Question: (1) (6 pts) True or False ? You do not have to justify your answers. (a) 4logn is (n logn) (b) n log n is

(1) (6 pts) True or False ? You do not have to justify your answers. (a) 4logn is (n logn) (b) n log n is (4logn) (c) nVlog n is (vn logn) (d) Vn logn is (nylogn) (e) log n is (logn) (f) n log n is (n1.25) (2) (6 pts) Assuming T(1) = 0(1), for each recurrence below provide a bound for T(n). You may use any valid technique/tool. (a) T(n) = 9T) + (n) (b) T(n) = 4T() + O(n)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
