Can this be solved

Using this method?

  

2. (15 points). Complexity Analysis. Maximum Subarray problem: Given an array A[1...n] of numeric values (can be positive, zero, and negative) determine the subarray A[...] (1ijn) whose sum of elements is maximum over all subvectors. Below is a brute-force algorithm. Analyze its best case, worst case and average case time complexity in terms of a polynomial of n and the asymptotic notation of e. You need to show the steps of your analysis. MAX-SUBARRAY-BRUTE-FORCE (A) n = A.length max-so-far- = for=1 to n sum = () for h = 1 to n sumsum + 1[h] if summax-so-far max-so-far = sum low = 1 high return (low, high) = h