Consider another approach at the calculation using some pre-computation. In this case, we use a new array B, with elements defined as This array turns out to be useful since Bli - BjA.. A] Algorithm 3 subsequenceWithMaxSum_2(A) 1: n*- Size of A 2: B ?Array of size n 3: for i = 0, . . . , n-1 do 4 for j =i, . . . ' n do 7: 8: answer? (0.0 9: for i=0, , n-1 do 10: forj -i,... ,n - 1 do if B[i] -B[] > B [answer[0]]-B[answer ] then 12 answer-W) 13: return answer (a) [2 marks] Using big-O notation, what is the time cost of Algorithm 3 as a function of n? Justify your