Q:Question:1.2-2 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 n steps. For which values of n does insertion sort beat merge sort?A:Answer:See a step by step answer