Using Big$-$O notation, what is the worst$-$case running time of the following

public static int f$21($int N$)\{$

int count $=0$;

int i $=1$;

while $($i $<$ N$)\{$

count $+=$ i;

i $=$ i $+3$;

$\}$

return count;

$\}$