Please give full steps and explain the input and output and process.

Although merge sort runs in linearithmic time and insertion sort runs in quadratic worst- case time, the constant factors in insertion sort make it faster for lists whose length is small. It might make sense to use insertion sort within merge sort when sub-problems become sufficiently small. Consider a modification to merge sort in which n/k sub-lists of length k are sorted using insertion sort and then merged using the standard merging process, where kis a value to be determined. (14 points total) a. Show that the n/k sub-lists, each of length k, can be sorted by insertion sort in O(nk) worst-case time. (4 points) Next, modify the merge sort algorithm to incorporate insertion sort into the process KEY IDEA (2 points): Algorithm ModMergeSort(. _): (8 points) Input: Output: PROCESS