Suppose we are comparing implementations of insertion sort and merge sort on the same machine.

For inputs of size n, insertion sort runs in 8n² steps, while merge sort runs in 32nlogn steps.

For which values of n does insertion sort beat merge sort?

Group of answer choices:

1. n < 1024

2. n > 1024

3. n < 16

4. n > 16

5. Merge sort is always better since O(nlogn) is better than O(n^2)