please help, I'm completely lost...

(1) under which the output of the In the maximum subarray problem, where the input is an array of length n, give a condition FIND-MAXIMUM-SUBARRAY algorithm is (i+1, sum) for some index and a positive value "sum | suppose that in the maximum subarray problem the input is an array such that the values Al alternate between positive and negative (say, AG]>0, AG] Cross som else. If rought som leftism and rightson cross.som else return (cross law, creas-high cross-sum) returelleft:I left high left.com) returnleyit law, nyt high. Might.com) (1) under which the output of the In the maximum subarray problem, where the input is an array of length n, give a condition FIND-MAXIMUM-SUBARRAY algorithm is (i+1, sum) for some index and a positive value "sum | suppose that in the maximum subarray problem the input is an array such that the values Al alternate between positive and negative (say, AG]>0, AG] Cross som else. If rought som leftism and rightson cross.som else return (cross law, creas-high cross-sum) returelleft:I left high left.com) returnleyit law, nyt high. Might.com)