Question $10$

Successfully signed in is pis

Consider the following algorithm.

Algorithm $S(n)$

i

if $)(2$

i

retum $1$:

$3$

else

i

return $2**S(\sqrt[\phantom{2}]{n})$;

$\}$

$\}$

Which of the following is the time complexity of the algorithm $S|n|?$

$10$

$11,O(logn)$

$12$

$13$

$O(nlogn)$

$14$

$15$

$o(n^2)$