5. Find the worst-case time complexity of the SumMystery algorithm below. For simplicity, you may assume that n is a power of 2 (so line 8 doesn't need to round down until the last iteration). Input: data: array of n integers Input: n: size of data Algorithm: SumMystery at n 4 while t21 do s fori 1 to t do sum-sum+ data 7 end 9 end o return sum/(2n -1)