4. Question about Algorithm Analysis (Recursion tree and Time Complexity).

he following questions about the RecursionMystery algorithm below. Input: data: array of n integers 1 Algorithm: RecursionMystery 3 DeeperMystery(data); s DeeperMystery(data); Input: n: size of data datal1.n 1]-RecursionMystery(datal1..n-) data 2.n-RecursionMystery(data 2..n) 6 return data: 5 pointsl Give a recurrence describing the worst-case time complexity for RecursionMystery if the worst-case time complexity for DeeperMystery is (2") ) [10 points] Sketch a recurrence tree for RecursionMystery [10 points) Use this recursion tree to analyze the worst-case time complexity of RecursionMystery Use this recursion treeto analyze the worst-caecf Recursion Mystery. he following questions about the RecursionMystery algorithm below. Input: data: array of n integers 1 Algorithm: RecursionMystery 3 DeeperMystery(data); s DeeperMystery(data); Input: n: size of data datal1.n 1]-RecursionMystery(datal1..n-) data 2.n-RecursionMystery(data 2..n) 6 return data: 5 pointsl Give a recurrence describing the worst-case time complexity for RecursionMystery if the worst-case time complexity for DeeperMystery is (2") ) [10 points] Sketch a recurrence tree for RecursionMystery [10 points) Use this recursion tree to analyze the worst-case time complexity of RecursionMystery Use this recursion treeto analyze the worst-caecf Recursion Mystery