Given the following function f$1,$ give the best order of growth of the running time $($ie$.$ The time complexity using Big$-$o notation$).$ public int f$1($int N$)$