Given the following function f$1,$ give the

best order of growth of the running time

$($i$.$e$.,$ The time complexity using Big$-0$

notation$).$

public int $f1($int $N$

int $a=0$;

for $($int $i=1i+++=1O(N)O(N^2)O(1)O(N^{2}logN)O(NlogN)O(logN)i$; $i++j=1$;$j2$