1) Modify the mergesort as follows: instead of dividing the input list into two lists, the list is divided into three sublists of (roughly) the same size.
(a) Write down the recursive algorithm;
(b) Let t(n) be the running time of your algorithm, write a recurrence for t(n);
(c) What is the running time and how does it compare tothe traditional mergesort? Note that you need to solve for t(n) first. Note: if you want to merge two lists L1and L2, you can just say in your algorithm "Merge L1 and L2."