CS-232-01 Computer Science II Lab 3: Function Growth \& Algorithmic Complexity Problems. 1. Using an online function plotter, plot functions fi(x)=100 log2(n),f2(x)=n/10,f3(x)=. List functions in order of growth from fastest to slowest. Which are the values of n beyond which a function becomes bigger than another in this set of functions? 2. Determine the number of times the iterations are executed in the following code segment. Print the number of iterations for a user-defined value of n and verify that number by computing the function that describes the same number theoretically. Explain your reasoning. for(inti=0;i<>