Q:Question:3A. Crossover Point Suppose we are comparing implementations of insertion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 6 n^2 steps, while merge sort runs in 60nlgn steps. For which values of n does insertion sort beat merge sort? (5 points) Answer 2 ? n ? 58A:Answer:See a step by step answer