2) An alternative Mergesort algorithm divides the list in 3 equal parts instead of 2. a) Write in pseudocode the new Mergesort algorithm, including the Merge function (in pseudocode). Feel free to use the algorithm Merge provided in the lectures, or to alter it if necessary. b) Write the recurrence relation for the time complexity of the new algorithm and solve it enough to give the time complexity in 0 notation. c) Compare the time with that of the standard Mergesort, and comment on the comparison