Develop a dynamic programming algorithm that given a sequence a₁,, a_nof real numbers, finds a subsequence a_s,,a_tof consecutive elements of a so that the sum is maximized. If a_i< 0 for all i, we define the maximum sum to be zero, which is obtained by selecting the empty subsequence.