For the following code segment, the time complexity is

int func$($int arrJ, int n$)$

if $($n $<1)$

$\}$

return $0$;

int m $($int$)$ sqrt$($n$)$;

int left $[$m$],$ right $[$m$]$:

for $($int i $=0$; i