(a) Using big-O notation, what is the time cost of Algorithm 4 as a function of n? Justify your answer.

Here is a third approach to the calculation, where the array B is computed a different way. Algorithm 4 subsequenceWithMaxSum 3(A) 1: nf- Size of A 2: B-Array of size rn 3: B[n - 1] B[answer[0]] - B[answer[1]] then answer- (i,j) 12: return