Consider the following algorithm,

Algorithm S$($n$)$

$\{$

if$($n $<=2)$

$\{$

retun $1$:

$\}$

else

$\{$

return $2^*$ S$($sqrt$($n$))$

$\}$

$\}.$ Which of the following is the time complexity of the algorithm S$($n$)?$

O$($n $^2)$

O$(2^$ n$)$

O$($n $*$ log$($n$))$

O$($log$($n$))$