Put these functions in order so that if f(n) = O(g(n)) (i. e. f(n) is Big-Oh of g(n)), then f(n)appears before g(n)in the list. Group together functions that have the same asymptotic order of growth (i. e. f(n)= Θ(g(n))).

n², nlog n, n³ + log n, √n, n² +2n log n, log log n, 17 log n, 10n³/², n⁵ - n⁴ + 2n,
5 n² log log n, 3n² + n³ log n, n +6 logn