Write a method named maxSortedSubsequenceSum that accepts an array of integers and returns the maximum sum of any non-decreasing subsequence of values in the array, found using dynamic programming.
A subsequence contains values in the same order they occurred in the original array, though not necessarily consecutively.
For example, if the array stores {10, 22, 9, 33, 21, 50, 41, 60, 80}, the max-sum sorted subsequence is {10, 22, 33, 50, 60, 80}, so the value returned should be its sum, which is 255.
If the array stores {40, 10, 20, 5}, the max-sum sorted subsequence is {40}, so the value returned should be its sum of 40.
The key constraint of this problem is that you must solve it using a bottom-up dynamic programming approach.
Do not use recursion. Your solution must use dynamic programming instead.
You are allowed to construct any data structures (array, list, set, map, etc.) necessary to store the data for your dynamic programming algorithm.
You may assume that none of the values in the array are negative.
Note that this problem is similar to longestSortedSubsequence, so you may want to refer to that problem.
