Answer the following questions about the Rech Luput A array with real numbers Input size of data Output permutation of data such that AU SA[2] S... SAM Algorithen RecMystery Sort 22 then 3 if A[1] > A[2) then 4 Swap A11 and A121 5 end 6 else ifn > 1 then 7 first = In/4). 8 third = n - first; RecMystery Sort(A[I third]); 10 RecMystery Sort(A[first. n): Il RecMystery Sort(A[1 third]): 12 end 13 return A 9 a) (10 points) Write a recurrence that describes the worst case time complexity of RecMysterySort. Show your work b) [5 points) Find the worst case time complexity of RecMysterySort. Show your work. c) [10 points) How does RecMystery Sort compare to Merge Sort and Insertion Sort? Justify your answer. A table of approximate log values appears below. plog , (3) logo (1) log: () 10g;(4) log: (?) 10g, (3) log: (3) log: (4) logo (3) log In 792 208 -0.208 0.262 1 262 -0.262 -3.819 3.819 -4.819 4.819