In C++

Description In this lab assignment, your job is to implement the O(nlogn) 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 An] of n integers, and would like to find i. and ,. (1-i*-j"