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

public List f$1($int N$)$ f

List alist $=$ new ArrayList$<>()$ ;

for $($int i $=0$; i $<$ N; i$++)$

alist. add $(0,1)$ :

return alist;

Select one:

$0($N log N$)$

$00(1)$

$0($N$?$ log N$)$

$0($N$2)$

$0($ log N$)$