Exercise 1: Suppose you are given k sorted arrays, each with n elements, and you want to combine them into a single array of kn elements. One approach is to use the Merge subroutine presented in the chapter Divide \& Conquer, repeatedly, first merging the first two arrays, then merging the result with the third array, then with the fourth array, and so on until you merge in the kth and final input array. What is the running time taken by this successive merging algorithm, as a function of k and n, ignoring constant factors and lower-order terms? Justify your