Suppose that we compare the insertion sort method with the merge sort method in the same computer.
For entries of size n, the classification with insertion requires 8n^2 steps, while classification with merge requires 64n*lg(n) steps. For which values of n, does insertion sort method outclass the merge sort method? Please explain.