Given a sequence of n real numbers A[1] .. A[n], we want to develop an algorithm to determine a contiguous subsequence A[i] .. A[j] for which the sum of elements in the subsequence is minimized. For example, in the sequence {4, 1, -6, 2, -4, -1, 6, 1, -2, 1}, minimum value contiguous subsequence is {-6, 2, -4, -1} for the sum -9.

1. Describe a brute-force solution for the problem. Give your algorithm in pseudocode. (10 pts)
2. Describe a dynamic programming solution for the problem by providing ONLY the recursive function needed. (10 pts)