Can someone please share java code and output with short explanation for :

Using SublistSum (Dynamic prog): Implement an algorithm to determine the largest sum of adjacent sub list of numbers (negatives are allowed) using dynamic programming approach. For example, given numbers {1, -3, 4, -2, -1, 6} the largest sum is 7 for the sub list in bold. Write test program for it. Analyze the algorithm and present in Big O notation. It should be able to give the algorithm analysis and time complexity using Big O notation