II. (10 points) Consider the following bit of pseudocode: for (int i= 0; i s n; i++) Print "Hello World"; for (int j= 1; j n; j++) for (int k = 0; ks nlgn; k++) Print "Hello World"; When n = 2, how many times will "Hello World" be printed? When n =4, how many times will "Hello World" be printed? Assuming that the print is the basic operation, what is the complexity function of this pseudocode? T(n) = III. (10 points) Put the following 5 complexity functions in the proper linear order such that each function is in o (little o) of all functions to the right. (nlgn) (n/lgn) n/Ign n nlgn