Given an array a of n nonnegative integers, the maximum window area (MWA) of a is defined as the maximum of (j − i + 1) min i≤k≤j (a[k]), taken over all combinations i and j for which 0 ≤ i ≤ j ≤ n − 1. For example if a = 3, 3, 1, 7, 4, 2, 4, 6, 1, then MWA(a) = 10 via i = 3 and j = 7, since the minimum value in this range is a[5] = 2, and (7 − 3 + 1)(2) = 10. Clearly describe a divide-and-conquer algorithm for computing MWA(a). Provide a recurrence that describes its running time, and use it to provide your algorithm’s running time. Warning: credit will not be awarded for algorithms that seem vague or incomplete, or that do not achieve an o(n 2 ) running time