Instructions: Answer all the questions below. 1. Reorder the following efficiencies from smallest to largest: ( 6 marks) a. 3n b. n8 c. n9 d. 20 e. n2log2(n) f. log2(n) Ans: 2. Determine the big-O notation for the following: (4 marks) a. 5n5/2+n2/5 b. 6n2log2n+9n c. n3(3n6+n+18) d. n3(5n2+n3/2) Ans: Instruction: Show ALL workings for the questions below. Indicate the running time for each line. 3. If the algorithm dolt has an efficiency factor of 9n3, calculate the run-time efficiency of the following program segment: ( 2 marks) for(i=1,i