I need help with the following problem

(3) Give Big-O bounds, in terms of n, for each of the code fragments below. You should formally derive the running times of each algorithm and then give the Big-O result (merely stating running times or high-level explanation of running time do not suffice) (a) (10 pts) 1 n=A.length 2 prefix=0 total0 4for i = 0 to n-ido 5 | prefix = prefix + A[i] 6 | total= total+ prefix 7 end 8 return total