Consider the Maximum Contiguous Subarray (MCS) problem using the divide and conquer approach on the following array: [-2, 1, x, -3, 5, 2]. The divide and conquer algorithm returns the maximum of ( lmax, rmax, cmax, where lmax is the MCS of the left half array, rmax is the MCS of the right half array, and cmax is the MCS straddling the middle of the array. What must be true about x so that rmax is (strictly) bigger than both lmax and cmax? Show your work