Write a method that returns the sum of all the integers in array 'nums' in all of the array indicies from 'low' to 'high' inclusive. As preconditions, you may assume that 'low' and 'high' are non-negative, but you may NOT assume that 'low'<='high'. If 'high'<'low' then the result is zero. If 'low' is greater than the last index in the array, also return zero. If 'high' is greater than the last index of the array, find the sum from 'low' all the way to the end of the array. Look at the test data for examples. You MAY solve this recursively, but recursion is NOT required.