Suppose you have m sorted arrays, each with n elements, and you want to combine them into a single sorted array with mn elements. 1. If you do this by merging the first two arrays, next with the third, then with the fourth, until in the end with the last one. What is the time complexity of this algorithm, in terms of m and n? 2. Give a more efficient solution to this problem, using divide-and-conquer. What is the running time