A contiguous subsequence of a sequence is a subsequence made up of consecutive elements of the sequence. For example, if the sequence is 6, 10, 5, -10, 20, 30, 4, 5, 7, then, 5, -10, 20, 30 is a contiguous subsequence but 10,-10, 4 is not Following the four steps in the design of DP algorithms, devise a linear-time al- gorithm that takes a sequence 1...n] and returns a contiguous subsequence of maximum sum (a sequence of length zero has sum zero) (5 points)