in c++

Description In this lab assignment, your job is to implement the O(n log n) time divide- and-conquer algorithm for the Max Subarray Problem; for the pseudo-code, see page 72 in the textbook or the lecture slides. Recall that in the problem, we are given as input an array A[1...n] of n integers, and would like to find i* and j* (1 right-sum and left-sum 2 cross-sum return (left-low, left-high, left-sum) elseif right-sum left-sum and right-sum > cross-sum return (right-low, right-high, right-sum): else return (cross-low, cross-high, cross-sum) a au w