Alice implements Merge Sort so$,$ on a particular machine, it requires exactly $8$n log n$$ steps to sort n elements. Bob implements Heap Sort so it requires exactly $5$n log n$$ steps to sort n elements. Charlie implements Selection Sort so it requires exactly $2$n$2$ steps to sort n elements. Suppose that Alice can sort $1000$ elements in $1$ minute.

$1)$ How many elements can Bob sort in a minute? How many can Charlie sort in a minute?