number 3 thank please show steps

fil1 in from here Write a recurrence relation for your algorithm and then solve it to obtain the worst-case asymptotic time complexity for your algorithm. 3. Give a recurrence relation for the stated algorithm and then solve it (using the Master method) to get the asymptotic time complexity (20 points) void magicsort2lint ALl,int i, int j) Sorts the subarray A[ij if ) when there are only 2 elements i A A) swap tA, i,) swaps Al and Aj) t else t int k -+173 magicsort2 (A,i,j-k)/ sort first two thirds magicSort2(A,i+k,j sort second two thirds magicsort2(A,i,j- / sort first two thirds again magicSort2(A, i+k,j): /1 sort second two thirds again Challenge Problem (No extra credit, Only for fun) 1. Draw the recurrence tree for T(n) = T(n/4) + T(3n4) + cn. Give a tight asymptotic bound for T(n). Rules 1. Please do not discuss any of these problems with others. You're welcome to talk about concepts or practice problems presented in the class. 2:48 PM O Type here to search