True or False.

a. (logn)^10= (n^0.2)

b. if c

c.if g(n)= (n^2), then g(n)= (n^3)

d. if g(n)=O(n^2), then g(n)=O(n^3)

e. karatsuba algo lets you multiply two m-bit integers in time. O(m).

f. if k(n)=O(y(n)), then 2k(n)=O(y(n)).

g. can this be solved by using the master theorem? T(n)=T(n-4)+nlogn for n>1 T(1)=1. (estimate)

Transcribed image text