questions 14-17 discrete math / computer scisnce

14. How many times is the variable "count" updated inside the loop in the pseudocode fragment below? count =0 For 1=1 to 3 For j=1+1 to 4 count : = count +(j1) End-for End-for a. 0 b. 6 c. 10 d. 12 15. Select the function that is (nlogn). a. 5n2+17logn b. 6nlogn+n1.1+2 c. 23nloglogn+3nlogn d. 2nlogn+n2 16. f(n)=4n2+5n+61. Which choices for c and n0 are sufficient to prove that f is O(n2) ? a. c=9 and n0=1 b. c=5 and n0=3 c. c=24 and n0=1 d. c=15 and n0=1 17. Select the description that fits the sequence below: 8,5,2,2,1,1. a. Non-decreasing but not increasing b. Non-increasing and decreasing c. Non-increasing and not decreasing d. Non-decreasing and increasing