Create an implementation of mergesort that uses k-way merges rather than 2-way merges. Analyse your algorithm, formulate a theory about the ideal value of k, and conduct tests to support your theory.

Dr. Sponge thinks it's too hard to implement Merge. So, he wants to replace Merge with Insertion Sort (yes, the insertion sort you learned in class). The following is the pseudo-code of the new Merge-Sort, Merge-Sort(p, r) 1. if p == r return 2. q = floor of (p+ r) / 2 3. Merge-Sort(p, q) 4. Merge-Sort(q+1, r) 5. Insertion-Sort(p, r) Give the recurrence for the running time of this new Merge-Sort and solve it. We let T(n) denote the running time when input array has n elements. By solving the recurrence (no need to show how you solved it), we obtain T(n) =

Describe the benefits of using the merge sort in Java. What are the key steps that must be taken to ensure an efficient sorting of objects? Also, specifically think of and give a real-life scenario where Merge sort may be used Merge sort may be a better fit than Quick and Radix sorts

Write a merge Merge Sort Implementation in Go.