Find the Big-O (worst case) of this code using summation . Hereis the pseudo code: Here's the pseudo-code:pseudo max_sum = 0for i = 0 to n-1:current_sum = 0for j = i to n-1:current_sum += A[j]i 1 answer