Q:Question:Thank you for help with this Discrete math Suppose we are comparing implementation of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort runs in 64n log2 n steps. For which values of n does insertion sort beat merge sort?A:Answer:See a step by step answer