For each subprogram below, explaine what is computes, derive (in detail as shown in lect210120-1.pdf: pages 10, inserted page withcost/times-table, and 11) the worst case running time first, provide its asymptotic tight bound (big-Theta es-timate), and answer specific questions.

(c) procedure P_3 (integer n); for i:=1 to n loop 2:= na; while x > 0 loop I:=-2.i; end loop; end loop; end P-3