Suppose you need to merge k sorted arrays, each with n elements, into a single sorted array with k n elements. a) An inefficient way to do this is: Merge the first two arrays, then merge in the third, then merge in the fourth, and so on. What is the run-time complexity of this algorithm in terms of n and k? b) Design a more efficient solution to this problem using the Divide-and-Conquer approach. What is the run-time complexity of your algorithm?