Write a recursive function to calculate the minimum positive subsequence sum (MPSS). In other words, of all subsequences whose sum adds to a positive number, you want to determine the minimum of such sums (IN JAVA HINT 1. Use the same divide and conquer algorithm for MSS, but now it is not so easy to compute MPSSmiddle, Explain why? (You could make a counter example on a piece of paper) 2. For each subarray there are n/2 such
OR
OR