Note: Please use the algorithm dynamic programming strategy in the coding and include the screenshot of executed code and output
Given a sequence of n numbers A(1) ... A(n), write a java or
python program for finding a contiguous subsequence A(i) ... A(j)
for which the sum of elements in the subsequence
is maximum. Apply dynamic programming strategy in your
implementation.
For instance: [-2, 11, -4, 13, -5, 2] => [11, -4, 13] = 20.