Show how to Merge (not Mergesort) three ordered lists each of size n/3, with a total of at most -n compare operations. (b) Let's examine a new Merge sort algorithm, where parameter A in (A,n) is a list of numbers to be sorted and n is the total length of list A. Procedure mergeSort (A.n):: if Else n=1 then return A divide A into three equal size lists B, C, D, :=mergesort (B,n/3) C:=mergesort(C,n/3) D: mergesort(D,n/3) return merge(B, C, D) End. Set up and solve a recurrence relation to analyze the worst-case number of operations of compares that this version does.