1. Comparison According to Asymptotic Complexity. Below you find a list of functions that could appear as functions describing the running time of algorithms: t3 , 3 n2+2 n, 5log2, 2-3", 3-n', 3-2", nlog7, logzn" .2n The functions are separated by ".". Order the following 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 fifs such that fi(n)- O(fz(n)).fi(n) -O(f(n)), etc. Indicate as well two functions f g that are asymptotically equivalent, that is, where both In)- Olg(n)) and g(n)- On)) hold. Sample I. Input: 54321 Output: 1 4 0 1 1 3