Order from the least to the highest complexity the following running time of some algorithms. That is, rank the following in order of increasing growth, and identify the ones that have the same asymptotic growth.
O(nlogn), O(p^n), O(n^m), O(2^n), O(2^logn), O(log n^n), O(n log^2 n), O(2^√n), O(5^n log 2^n), O(n^q), O(2^nlogn), O(n^log2^n), O(1.2^(n)) (here '.' is the decimal point)