this Subject is about design and analysis of algorithms. Coding is not needed

Given an array A. Consider the following divide-and-conquer sorting algorithm: 1. Split A into small subarrays of length k. 2. Sort each subarray using InsertionSort algorithm 3. Combine the sorted subarrays into the final sorted array. Q1: Design an algorithm for merging k sorted arrays into a sorted array in O(n log(n/k) time (i.e. find an algorithm for step 3 with the indicated runtime) Q2. Show that the runtime of the algorithm is O(nk + n log(n/k)) Given an array A-[2, 7, 5,-3, 11, 4, 8,-5, 1 Run the partition procedure from QuickSort with pivot 1 (the last element) At each iteration show the following 4 regions: a) pivot c) unprocessed d) pivot