collected L (15 points) Give each as an explictt function of n. Don't leave logarithms as exponents unless absolutely necessary. 2.3- I. (15 polnts) For the following bit of pseudocode: Print "Hello World" 1, when n = 4, how many mes will "Hello world" be printed? 2, when n 9, how many times will "Hello world" be printed? 3. If printing "Hello World" is the basic operation, what is the complexity functon of this pseudocode