Ordering Functions by Growth Rate (log*, constants in disguise)

To rank functions slowest-to-fastest, first unmask the impostors: rewrite each as a power of $2$ via $n=2^{\log n}$. Some "functions" are secretly constants, and $\log^{*}n$ grows slower than any iterated logarithm.