Question: Big O ( 2 5 points ) This problem is on determining whether one function is Big - O of the other. Provide a proof

Big O(25 points) This problem is on determining whether one function is Big-O of the other.
Provide a proof for your answers. If you are showing that if finO(g), then you must show
that there is a constant c1 such that for every n1,f(n)cg(n). Your proof must state
the value of the constant c, and, if your inequality only holds for values of n that are above
some threshold N, then you must provide the value of N as well.
If you are showing that f!inO(g), then you must show that for every constant c1 and
every threshold N>0, there is always an n>N for which f(n)cg(n).(Alternatively, you
may provide a proof by contradiction.)
In your proofs, you may use the fact that for every k>0 and a>0,nkinO(nk+a), and
logkninO(na).
(a) Is 9n5+3n3+7inO(n5)?
(b) Is n2-1inO(log3(n))?
(c) Is 22n+1inO(22n)?
(d) Prove or disprove: If f(n)inO(g(n)) then logf(n)inO(logg(n)).
 Big O(25 points) This problem is on determining whether one function

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!