Order the following functions into a list such that if f(n) comes before g(n) in the list then f(n) = O(g(n)): ^2, 2^n, log2n, ^3, log2n, ^2 + og2

Question 1 (10 points) Order the following functions into a list such that if f(n) comes before g(n) in the list then f(n)=O(g(n)) : n,2n,nlog2n,n3,log2n,n2+log2n