Given the following method f$1,$ give the best order of growth of the running time $($i$.$e$.,$ The time complexity using Big$-$O notation$).$

public int f$1($int N$)\{$

int sum $=0$;

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

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