Let f(n)-12 logs (8n* +16n) + 5n0.05 Which of the following is true? (Select one.) ○ f(n) € 0 (1) f(n) € 0 (0.05) f(n) € 8 (log₂ (n)) Of(n) € (log₂ (n) x log₂ (n)) f(n) € 0 (log₂ (n) x 10.08) Of(n) 0 (n loga (n)) Of(n) € 0 (n4 loga (n)) f(n) €0 (4.05)

my_fib 1, TRUE, FALSE) } c) Not allowed to use or other multiplication operators for this one. my_multiply <- function(x, n) { if (length (n) != 1 && is.na(n) || !is.numeric(x) || n %% 1 != 0) { stop ("n must be a whole number and x must be a numeric vector") } else { } while (n = 0) { out <-out + x n <- n - 1 }

Consider the following algorithm that uses a sorted list of n elements (alist). What is the worst case runtime of this algorithm? for each element in alist    1. ask the user for an input, call it value    2. search value in alist using binary search    3. if value exists in alist, print "successful"       otherwise print "unsuccessful"      Question options: a. O(log n) b. O(n) c. O(n log n) d. O(2^n) e. O(n^2) f. O(1)

True or False? (a) Is 2n+1 = O(2n) ? (b) Is 22n = O(2n) ?

I was told the answer is (n lg n) but I am not sure.

10*/n + 5n*log(n) belongs to O e(n) O 0(n) O e(n²). O e(nxlog(n))