2. Find the worst-case time complexity of the RecursionMystery algorithm below. Show your work. For simplicity, you may assume that n is a power of 2 (i.e., Input: data: array of n integers Input: n: size of data 1Algorithm: RecursionMystery 2 if n= 1 then a data- 4 else RecursionMystery(data1.mid) RecursionMystery(datalmid1.. Reverse the subarray data[1.mid Add mid to all values in datalmid +1.. o end 1 return data