ans all the questions int $a=0,i=n$;

while $(i>0)$

$lat=1$;

$il=2$;

Choose the correct time

the complexity of the following code:

Int i$,$ j$,k=0$;

$=\frac{n}{2}$;$in$;$i++1$

for $(j=2$;$jn$;$j=j**2)$

$,k=k+\frac{n}{2}$;

Choose the correct option.

$34,8,64,51,32,21$

Write briefly about $P$ and NP type problems.

always runs faster than algorithm $A".$ Do you think this statement is true? If not explain your answer.