use divide-and-conquer approach to design an efficient algorithm that finds the contiguous subsequence with the maximum area in a given sequence of n nonnegative real values. analyze your algorithm, and show the results in order notation(big o). can you do better? obtain a linear-time algorithm. the area of a contiguous subsequence is the product of the length of the subsequence and the minimum value in the subsequence.