(a) (10 points) Suppose you implement a variant of MergeSort. Instead of breaking the given list into 2 sublists, you break the given list into 3 sublists. Write the complete resulting algorithm here in pseudocode. Included below is pseudocode for MergeSort as discussed in class. Solution: Algorithm 1: MergeSort with a 2 piece recursion (replace this pseudocode with your own; model your answer on this) Function MERGESORT(A) : If LEN(A)=1 : L Return A Let m2LEN(A) Let LA[1:m],RA[m+1:n] Let LMERGESORT(L) Let RMERGESORT(R) Let AMergE(L,R) - Return A Function MERGE(L,R) : Let nLEN(L)+LEN(R) Let A [] Let j1,k1 For i=1n If j>LEN(L) : [A[i]R[k]kk+1 ElseIf k>LEN(R) : [A[i]L[j]jj+1 ElseIf L[j]R[k] : [A[i]L[j]jj+1 Else A[i]R[k] kk+1 (b) (5 points) Is this algorithm more efficient, less efficient, or equally efficient as the standard MergeSort algorithm in terms of asymptotic time complexity? Justify your answer. This question will involve material covered on January 23, 2023 in class. Solution