Show the working of Algorithm 4 for the Maximum-Sum Subsequence problem on the integer array <4, 3, -6, 2, -5, 9, -7, 8, -1,

1.  

Show the working of Algorithm 4 for the Maximum-Sum Subsequence problem on the integer array by filling the following table that indicates the values of variables thisSum and maxSum after each iteration of the j loop in the algorithm. Assume that array indices start at 1 and end at 11. this Sum maxSum Initial value 0 0 After the iteration where j = 1 2 3 4 5 4 4 6 7 8 9 10 11