5. Recursive algorithm trace Consider the following sorting algorithm (which you may assume is correct), called initially with i = 1 and j = n to sort a list of n numbers in array A: Sort(A, i, j) if A[i] > AU] then exchange A[i] A[j] AWN- if i + 12j then return k= (j-i+1)/3 Sort(A, i, j - k) Sort(A, i + k, j) Sort(A, i, j - k) A Solve the recurrence for Sort by applying the Master Method. (5 points) B Suppose Sort takes as input list (10, 12, 5, 2, 4, 8, 11). During its execution, how many times is element 5 compared to another element in A? ANSWER ONLY (15 points)