1. (10 points) Use the dynamic programming approach to write an algorithm to find the maximum sum in any contiguous sub-list of a given list of n real values. For example, given the sequence 3, -5,4.-35, 10, the output is 11 (4-3+10). Assume that the maximum sum cannot be negative; an empty sub-list is considered to have a sum of O.For example, given the sequence -3,-5, -4, the output is o Use the given problem instance: sequence: 3,-5,1,2,9,-8, 6 Analyze your algorithm, show the results in Big-0 notations, using the lowest to illustrate how your algorithm works. upper bound. Algorithm: Example:sequence: 3,-5, 1,2,9,-8,6 the time complexity of your algorithm ain how you get the above result