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..n 1] of integer); S := 0; for i := 0 to n 1 loop S := S + A[0]; for j := 1 to i loop S := S + A[j]; end loop; end loop; return S; end P 1;