I have attached it's about theory of computation

Order the following functions by their asymptotic growth rate. Write "f(n) < g(n)" if f(n) = o(g(n)) and "f(n) = g(n)" if f(n) = Θ(g(n)). Justify your answer; you may use any of the facts/theorems given in class or the textbook.  22n,   log3 n,   22n,   n,   nlg n,   n2.5,   lg(n1/2),   2lg n,   n100,   3n,   n0.1