Algorithms question, thanks!

Sort the following functions from asymptotically smallest to asymptotically largest, indicating ties if there are any. You do not need to turn in proofs (in fact, please don't turn in proofs), but you should do them anyway just for practice. First row is mandatory, second row is 1 extra credit point. 1 (n 2) lg(n^n) n! n^3 + n^2 n^lg n (lg n)^n 1 2^2^n n^2^2 To simplify notation, write f(n)