Problem 4. For this question, we will have to modify Merge sort algorithm. In the divide and conquer step, you will divide the array into thirds, recursively sort each third, and finally combine the results using a three-way merge routine. Answer the following question: 1. Write pseudo code for the modified Merge sort algorithm 2. What is the recursion equation? 3. What is the base case? 4. Show the recursion tree with at least 3 top levels and 2 bottom levels. 5. Solve the recursion equation using the recursion tree approach. Exactly how many com- parisons does this modified merge sort algorithm use in the worst-case? Show your work. CMSC351 - 0201 Homework 4 Due: Saturday, Feb. 27, 2021 6. What is the value of T(3)? 7. Verify the base case 8. In terms of runtime, would this modified Merge sort be faster or slower than the regular algorithm