The maximum subsequence sum problem is defined as follows: If ai, a2, ..., an are in Z, find the maximum value k ai, for all i, j, i n. We assume that the answer is 0 if all the ai are negative or if the sum is empty. The following algorithm finds a solution to the problem. Here, we assume that ajs are stored in the array A MAXIMUM-SUBSEQUENCE(A, MaxSum) 2 for i 1 to n 3 do 4 3 6 Sum = Sum +A [i] if Sum > MaxSum then MaxStan Sum else if Sum