III. (20 points) Suppose that we have m sorted arrays, each containing n -numbers, and we want to merge them into a single sorted array of mn numbers. Give an O(nm lg m)-time algorithm to solve this problem. Explain the steps of your algorithm and analyze its running time