(10 pts) 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. 1. After the iteration where j - value thisSum0 maxSum0 4 4