include the worst case running time for each line and the code's asymptotic notation

What does the code fragment compute? Give a computationally equivalent algorithm P_2 with a linear worst-case running time. procedure P_2 (integer n; array A[0..n1] of integer); S:=0fori:=0ton1loopS:=S+A[0];forj:=1toiloopS:=S+A[j]; end loop; end loop; return S end P1