Problem 4: (5 pts) The Mergesort3 algorithm is a variation of Mergesort that instead of splitting the list into two halves, splits the list into three thirds. Mergesort3 recursively sorts each third and then merges the thirds together into a sorted list by calling a function named Merge3. a) Write pseudo-code for Mergesort3 and Merge3 b) Let T(n) denote the running time of Mergesort3 on an array of size n. Write a recurrence relation for T(n). c) Solve the recurrence relation to obtain the asymptotic running time