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.

Input: data: array of n integers Input: size of data 1 Algorithm: RecursionMystery 2 if n=1 then 3 | data[1-0 4 else 5 mid- n/2 Recursion Mystery(datall.mid) 7 RecursionMystery(data[mid+ 1..n|) s Reverse the subarray data[1..mid 9 Add mid to all values in data mid 1.n] 10 end 11 return data