Answer the following questions about the Recursion Mystery algorithm below. Input: data: array of n integers Input: n: size of data 1 Algorithm: Recursion Mystery 2 if n + 1 then 3 data[1..n-1) = Recursion Mystery(data[1.n-1]); 4 end s Deeper Mystery(data); 6 if n+1 then 7 | data[2.1] =RecursionMystery(data[2..n]); 8 end 9 Deeper Mystery(data); 10 return data; a. Give a recurrence describing the worst-case time complexity for RecursionMystery if the worst-case time complexity for DeeperMystery is (4"). b. Sketch a recurrence tree for RecursionMystery. c. Use this recursion tree to analyze the worst-case time complexity of RecursionMystery. Hint 4" = (2")(2")