Mergesort splits the array into two equal parts and sorts them recursively and the sub-solutions are then merged. You modify the algorithm so that the input of length n is partitioned into three parts of equal size instead of 2 parts (and then merge the three sorted arrays to obtain the sorted array) to obtain a new algorithm Mergesort3. What will be the recurrence relation for the time complexity of Mergesort3? What is the solution to this recurrence relation (you may use master method or any other convenient method)?