2. For each part of this question, 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 are asymptotically the same (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.

Detailed explanation of the order for each placement, thank you!

(c) Logarithms in exponents. nlogg (n) logan n1/loga (m) n 1