Q:Question:Need help with these two problems 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 _2 n steps. For which values of n does insertion sort beat merge sort (i.e. takes more steps than merge sort)? /r/n What is the smallest value of n such that an algorithm whose running time is 100 n^2 runs faster than an algorithmA:Answer:See a step by step answer