Suppose you need to merge k sorted arrays, each with n elements, into a single sorted array with kn 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 runtime 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 runtime complexity of your algorithm?

For some reason I cannot comment back in the comments section, but there's no way this question needs more information. This is the whole question, there's no other information given in the assignment.