1- Comparison According to Asymptotic Complexity Below you find a list of functions that could appear as functions describing the running time of algorithms: (10 marks) 1. n3/2 2. glog2 n 3. 2* 3n 4. 3* n2 5. 3 * 2n 6. 3 * n2 + 2 *n3 7. nlogz 7 8. log2 na 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) = 0(f2(n)), f2(n) = o(f3(n)), etc. Indicate as well functions fig that are asymptotically equivalent, that is, where both f(n) = 0(g(n)) and g(n) = 0(f(n)) hold