Given a set A = {a1, a2, , an} of n integers, use pseudo-code to describe an efficient method of computing each of the partial sums sk = a1 + a2 + + ak for k = 1,2,,n. What is the running time for this method?

please provide more details in the answer including more than one method.