2. (advanced) Let's slightly tweak Merge Sort. Instead of partitioning the array into two subarrays, we will do into three subarrays of an (almost) equal size. Then, each recursive call will sort each subarray, and we will merge the three sorted subarrays. What is the running time of this new merge? Write a recurrence for the running time of this new version of Merge Sort, and solve it