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