Give the big-Oh characterization in terms of n.

Input: An array A storing n >= 1 of integers

Output: The sum of the prefix sums in A.

s < A[0]

t < s

for i < 1 to n1 do

s < s + A[i]

t < t+ s

return t