Q:Question:Although merge sort runs in ?(n n) worst case timejand insertion sort runs in ?(n^2) worst case time, the constant factors in insertion sort make it faster in practice for small problem sizes on many machines. Thus, it makes sense to coarsen the leaves of the recursion by using insertion sort within merge sort when subproblems become sufficiently small. Consider a modification to merge sort in which n / k sublists of length k are sorted usingA:Answer:See a step by step answer