Suppose that you have a magic machine that can do the following: Given a value n, it can sort any set of n (or fewer) real numbers in O(1) time. You are given n numbers, and the machine already tuned to the value n. You can use the machine as many times as you like, but you cant retune it to sort more than n numbers at a time. (a) What is the result of running merge-sort but using this machine for large base cases? Do you get o(n log n) time? (b) Do you have any other ideas for using this machine to sort in o(n log n) time? (note that little-o means any standard (n log n)-time algorithm is not good enough)