True or false: a. 14n + 12n2 + 4 ∊ O(n2 ) b. nn ∊ O(2n) c. n log2 n ∊ O(n log5 n) d. n log2 n ∊ O(n log n)  e. 9n / (3 log n) ∊ O(n) Note: logkn = (log n)k   please show work

Say whether each statement is right or wrong

Which of the following statements is not true if f(n) is O(g(n)): a)f(n) grows more c)f(n) and g(n) have the same growth b)g(n) grows more d)All of the statements mentioned here

13n+ 10 = O(n²) is also: O ОО O 3 O (little o) Ω

II. Determine the big-O measure for each of the functions in the lower table. Choose from the various big-O measures in the upper table. A. O(1) G. O(Y) M. O(Y¹6) S. O(N log N) Y. O(W!) EE. O(X³Y) B. O(X) H. O(log Y) N. O(Z) T. O(N²) Z. O(67W) C. O(log X) I. O(Y log Y) O. 0(Z²) U. O(N²log N) AA. O(V) D. O(X log X) J. O(Y²) P. O(Z³) V. O(W³) BB. O(VV) E. O(X²) K. O(Y³) Q. O(log N) W. O(W⁹) CC. O(25¹) F. O(X³) L. O(Y¹5) R. O(N) X. O(9W) DD. O(XY)

The following code implements Newton's algorithm for finding the square root of a number using repetition: n = 17                # we want the square root of 17 for exampleg = 4                 # our guess is 4 initiallyerror = 0.0000000001  # we want to stop when we are this closewhile abs(n - (g**2)) > error:  g = g - ((g**2 - n)/(2 * g))# g holds the square root of n at this point   Implement this algorithm in a function sqRoot(n), that returns the square root using recursion. Assume that the function will be called with positive numbers only. Note: Your initial guess cannot be zero!

The Big Oh of (100 N³+ N and 10 N) is N Select one: OTrue OFalse