What is the time complexity of the following recursive function:$$

$$int DoSomething $($int n$)$

$\{$

$$ if $($n $<=2)$

$$ return $1$;

$$ else $$

$$ return $($DoSomething $($floor$($sqrt$($n$)))+$ n$)$;

$\}$

$($A$)$theta$($n$)$

$($B$)$theta$($nlogn$)$

$($C$)$theta$($logn$)$

$($D$)$theta$($loglogn$)$

$*$

$1$ point

$($C$)$

$($D$)$

$($B$)$

$($A$)$