Problem 4. Let 41, 42, ..., 4 be k sorted arrays, each with ni elements. Give an O(nklogk) algorithm to combine them into a single sorted array that contains all of the of kn elements. (Assume k is a power of 2.)