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