4. The maximum sum subarray problem can be stated as follows. Given an array of n integers, A[0..n-1], find the maximum sum that can be obtained by adding some number of consecutive elements in the array. If all array elements are negative, the maximum sum is 0 (an empty sum). For example, consider the array with elements: 1,2,3,-2,5,-4,2,-10, 2,6 Then the maximum sum that can be formed is 9 by summing the first 5 elements. Give a "brute force" algorithm to solve the maximum subarray sum problem in (n2) operations. Show your analysis.