11. Let's examine a new MergeSort algorithm, where parameter A is a list of numbers to be sorted and n is the total length of list A. procedure MergeSort (A,n): return A else: divide A into three equal size lists B,C,D B - MergeSort(B, n/3) C MergeSort (C, n/3) D - MergeSort (D, n/3) return merge (B,C,D) Set up and solve a recurrence relation to analyze the worst-case number of comparison operations that this version does