Answer the following questions about the RecMysterySort algorithm below. lnpot: A : arriy with n real numbers lnput: n : kize of data Outpat peruutation of data moch that A[1]A[2]A[n] 1 Algorithm: RecMysthsort 2. if n=2 then 3 if A[1]>A[2] then Swap A[1] and A[2]: 12 end 13returnA : a) [10 points] Write a recurrence that describes the worst case time complesity of RecMysterysort. Show your work. b) [S points] Find the worst case time complexity of RecMysterySort. Show your work: el I1 maintsI How does RecMysterySort compare to MergeSort and InsertionSort? Justify your answer. A table of apor Answer the following questions about the RecMysterySort algorithm below. lnpot: A : arriy with n real numbers lnput: n : kize of data Outpat peruutation of data moch that A[1]A[2]A[n] 1 Algorithm: RecMysthsort 2. if n=2 then 3 if A[1]>A[2] then Swap A[1] and A[2]: 12 end 13returnA : a) [10 points] Write a recurrence that describes the worst case time complesity of RecMysterysort. Show your work. b) [S points] Find the worst case time complexity of RecMysterySort. Show your work: el I1 maintsI How does RecMysterySort compare to MergeSort and InsertionSort? Justify your answer. A table of apor