4: How many times does the while loop execute in the pseudocode fragment above? count 12 While (count>0) count count 3 End-while a. b. 4 C. d. 6 7.2 Growth of functions and complexity 5: Select the function that is (n log n). a. 5n17 log n b. 6n log nn12 c. 23 n log log n +3n log n d. 2n log n+n 6: Select the function that is not (m2) a. b. n log n3n2 .n! d. n logn + log log n 7: Select the function that is O(2) a. 3n b. n! c. n2 d. nlog n +4" Page 2 of S 8: f(n) 4n2+5n+6. Which choice for c and no are sufficient to prove that f is O(n2)? a. c 3 and no2 b. c- 5 and no 3 d. c 15 and no-1 7.3 Analysis of algorithms 9: Select the asymptotic worst-case time complexity of the following algorithm: Algorithm Input: a, a2, ..., an, a sequence of numbers n, the length of the sequence x, a number Output: ?? For i 1 to n-1 Forj-1 to n 1 to n For k If (a)(a)( Return( "True" End-for End-for End-for Return( "False) b. (n) c. (m2)