Two algorithms for this problem are given below.

1. Show how the algorithm works step by step on the sequence -2, 1, 3, 4, -1, 2, -2, 1,-5 4

2. Calculate the Big-Oh complexity of the algorithms

Algorithm 1 Finding Maximum Subarray Sum Input: An array of positive and negative integers A Output: The maxim sum b Final sum for i = 0 : n do bCurrent sum for j = i : n do if thisSummarSu then end if end for end for Return marSum Algorithm 2 Finding Maximum Subarray Sum Input: An array of positive and negative integers A Output: The maximum sum b Final sum bCurrent sum thisSurn 0 n stores the length of A for j 0 : n do thisSum thisSum + ALi] if thisSum > manum then else if thisSum 0 then thisSum 0 end if end if end for Return marSum