This is a data structures question. Please answer clearly and make sure the final answer is correct. Thanks

1- Consider the following functions. (2.5 marks) 1. n3/2 2. 8log2n 3. 23n 4. 3n2 5. 32n Order the above functions according to their asymptotic complexity. Start with the function having the smallest asymptotic complexity and move on to the function having the next largest one. That is, write them as a sequence f1,f2,,f9 such that f1(n)=O(f2(n)),f2(n)= O(f3(n)),etc. Indicate as well functions f,g that are asymptotically equivalent, that is, where both f(n)=O(g(n)) and g(n)=O(f(n)) hold