Problem 4. Consider the following pseudocode for a sorting algorithm, for 1. badSort(A[O...n-1) if (n = 2) and (A[0] > A[1]) swap A[0] and A[1] else if (n > 2) m = fan badSort(A[O...m -1) badSort(A[n - m --1-1]) badSort(A[O -m-1) Problem 4.c. (2 points) . State a recurrence in terms of n and a) for the number of comparisons performed by badSort. Problem 4.d. (2 points) Let a= 2/3, and solve the recurrence to determine the asymptotic time complexity of badSort