Q:Question:Suppose we are comparing implementation of insertion sort and merge sort on the same machine. For input size n, insertion sort runs in 8 n^2 steps, while merge sort runs in 64 n l g(n) steps. For which value of n does insertion sort beat (better than) merge sort? [ n ? 55; n ? 55; n ? 43; n ? 43 ]A:Answer:See a step by step answer