static int help$($int N$)\{$

if $($N $<1000)\{$

for $($int i $=0$; i $<$ N $*$ N $*$ N; i $+=1)\{$

System.out.print$("$be$")$;

$\}$

return N;

$\}$ else $\{$

for $($int i $=0$; i $<$ N $/2$; i $+=1)\{$

System.out.print$("$be$")$;

$\}$

return $2*$ help$($N $/2)$;

$\}$

$\}$

True or False. The best$-$case asymptotic runtime analysis for help is when

$$

N is less than $1000.$