Take the following list of functions and arrange them in ascending order of growth rate. That is, if function g(n) immediately follows function f(n) in your list, then it should be the case that f(n) is O(g(n)).

and Prove each case of f(n)=O(g(n)) in your arrangement above, by providing formal proof and enough justification.

fi(n) = n2.5 f2(n) = 2n f3(n) = n10 f4(n) = 101 fs(n) = 100n f.(n) = 2n f(n) = nlog n f:(n) = n2 logn f(n) = 2n + 100 f10(n) = n" fu(n) = n