merge sorting question:

I'd like to know the correct answer. uuwvava 1 - --PUAS) 2. Assume that the running time of som Provide clear, concise answers to each of the the following questions. . (10 points). Assume that the runni T(n) = 16n, and that the running of some implementation of Insertion Sort is 64nlog2(n). Considering only powers ime of me implementation of Merge Sort is T(n) = implementation faster than the Merge S ers of 2. what value of n 2 is the Insertion Sort se Sort implementation? .. (10 points). Using your answer above, how could you combine these implementations to improve the absolute running time of Merge Sort