Suppose we are comparing the implementations of insertion sort and merge sort on the same machine(You don’t need to know the alg
orithm to do this problem!). For inputs of size n, insertion sort runs in 8n^2, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort?
