Question 2 [20 points) Consider the following modification to the MergeSort algorithm: divide the in- put array into thirds (rather than halves), recursively sort each third, and finally combine the results using a three-way Merge subroutine. What is the running time of this algorithm as a function of the length n of the input array, ignoring the constant factors and lowest order terms ? (Hint: the Merge subroutine can still be implemented so that the number of operations is only linear in the sum of the input array length.]