3. (1 point) Below is another self-reduction for the SORTPRIMES problem. State a recursive algorithm using pseudocode for solving the SORTPRIMES problem based on this self-reduction. APS(A[ab])=A,pairsort(A[a],A[b]),A,withA:=APS(A[at2])A[t2+1b],A:=A[at1]APS(A[t1+1b]),A:=APS(A[at2])A[t2+1b]ifab;ifb=a+1ifb>a+1 4. (2+2 points) Using the same reduction as in the previous question, state a recurrence T(n) that expresses the worst case running time of the recursive algorithm corresponding to that reduction. From this recurrence, find a tight (Big-Theta) expression for T(n). Hint \#1: the Master Theorem may be the easiest solution here. Hint \#2: how many recursive calls are made, and how many elements are passed to them