Algorithm Mystery (A:array[1..n] of integer) sum, max: integer 1 sum = 0 2 max = 0 For i = 1 ton sum = 0 for j = i to n sum = sum + Alj] if sum > max then 0 AW NE max = sum 0 0 return max 2. (9 points) Fill out the following table w.rit. the above algorithm Mystery with the input size n. Step Total # of times executed