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$).$ n$<20$