Put the growth rates in order, from slowest-growing to fastest. That is, if your answer is f1(n), f2(n), . . . , fk(n), then fi(n) O(fi+1(n)) for all i. If two adjacent ones have the same order of growth (that is, fi(n) = (fi+1(n))), you must specify this as well. Justify your answer (show your work). You may assume transitivity: if f (n) O(g(n)) and g(n) O(h(n)), then f (n) O(h(n)), and similarly for little-oh, etc. Note that the goal is to order the growth rates, so transitivity is very helpful. We encourage you to make use of transitivity rather than comparing all possible pairs of functions, as using transitivity will make your life easier.

2ⁿ, n², 1/n , 1, 6n + 10¹⁰⁰, 1n , log₅(n²), log₂(n), 3ⁿ.