Rank various time bounds (functions of input size n, e.g., n^2, 2^n) in order of their asymptotic growth rates. The functions will be given as LaTeX code. If you aren't certain how the LaTeX would appear, an easy way to see is to enter it here: https://upmath.me/

Rank these time bounds in increasing order of growth:

(0) 1

(1) n!

(2) \sqrt{\log n}

(3) n^2 \log n

(4) 4^{\log n}

(5) 2^{\sqrt{n}}

(6) 2^{\log n}

(7) 2