please provide its worst case running time and its asymptotic tight bound :)

procedure P3( integer n); for i:=1 to n loop x:=n2; while x>0 loop x:=x2i end loop; end loop; end P3