Solve Dynamic Programming Problem and find its optimal solution.

Given a list of numbers, return a subsequence of non$-$consecutive numbers in the form of a list that would have the maximum sum. When the numbers are all negatives your code should return $[]$