Problem 3: Subsequence of max sum

Solving the problem of finding a subsequence with maximum sum using essentially a dynamic programming approach.