Suppose we are comparing implementations of insertion sort and merge

sort on the same machine. For inputs of size n$,$ insertion sort runs in $8$n$2$ steps, while merge sort

runs in $64$n lg n steps. What is the range of the values of n for which insertion sort beat merge

sort