Question: 1. ! (25%) In each subtask you will be given two functions of n: f(n) and g(n). In each subtask, specify whether (9) f(n) (g(n)),

 1. ! (25%) In each subtask you will be given two

1. ! (25%) In each subtask you will be given two functions of n: f(n) and g(n). In each subtask, specify whether (9) f(n) (g(n)), (O) f(n)=0(g(n)), (Q) f(n) (g(n)), or (N) neither of the above cases apply. For each subtask, your answer should be a single letter: , O, or N. You do not have to justify your answers for this task. If both case (0) and (O) apply, or both case (e) and (S2) applies, only write that case (e) applies. Each correct answer gives 4 points, no answer gives 1 point, wrong answer gives 0 points (a) f(n)-n10, g(n) 10n 4Vn. (b) f(n) = 100n2-n logn, g(n) = 2n-n100. (c) f(n)-nlogn, g(n) 100n. (d) f(n) (n sin(n))2, g(n2 (e) f(n) (nsin(n)2, g(n)(n cos(n))2. (f) f(n)-10log n, g(n)-log(10n) (g) f(n) log, g(n)- (h) f(n)= 100nio, g(n)= 210 log2(n). (i) f(n) n, g(n) RT 100 i) f(n) n100, g(n) n2 1. ! (25%) In each subtask you will be given two functions of n: f(n) and g(n). In each subtask, specify whether (9) f(n) (g(n)), (O) f(n)=0(g(n)), (Q) f(n) (g(n)), or (N) neither of the above cases apply. For each subtask, your answer should be a single letter: , O, or N. You do not have to justify your answers for this task. If both case (0) and (O) apply, or both case (e) and (S2) applies, only write that case (e) applies. Each correct answer gives 4 points, no answer gives 1 point, wrong answer gives 0 points (a) f(n)-n10, g(n) 10n 4Vn. (b) f(n) = 100n2-n logn, g(n) = 2n-n100. (c) f(n)-nlogn, g(n) 100n. (d) f(n) (n sin(n))2, g(n2 (e) f(n) (nsin(n)2, g(n)(n cos(n))2. (f) f(n)-10log n, g(n)-log(10n) (g) f(n) log, g(n)- (h) f(n)= 100nio, g(n)= 210 log2(n). (i) f(n) n, g(n) RT 100 i) f(n) n100, g(n) n2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!