Please explain your steps and how you got your answer

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 1 Algorithm: SumMystery 2 sum-0 4 while t 2 1 do 5 for i-1 to t do sum-s sum+ datali 6 7 7 end 9 end 10 return sum/(2n -1)