Recursive Algorithm Analysis: Problem 1. Consider the recursive function below. function mystery(L, i.j) if Ll Llij then endif ifj-i+>2 then swap L[i] with L[i] t=(j-i+1)/3 mystery(L,-1) mystery(L, i +t,j) mystery(L, i,j -t) endif end mystery (a) Write a recurrence for the number of key comparisons done by mysteryl (a key comparison is a comparison between two array elements). In this case, the only key comparison takes place on the first line of the function body. (b) Solve your recurrence to get the exact number of key comparisons as a function of n