Problem 6: An array A has n' elements, which can be either positive or negative integers. Give a divide-and-conquer approach to find a contiguous subarray of A, the sum of whose elements is maximum among all the possible subarrays of A