Write a method the returns the SUM of the numbers in the longest strictly increasing sequence of numbers in the array 'nums'. In the event of one or more ties for the longest increasing sequence, the one with the greatest SUM is returned (if there is also a tie for greatest sum, you will return that sum). As preconditions, you may assume that any numbers in 'nums' are positive and that 'nums' will not be empty. Look at the test data for examples.