Question: it is big-Oh, Proving things about asymptotic notation. Prove that (3n) n is not O(n n +1) Assume (3n) n is O(n n +1), so
it is big-Oh, Proving things about asymptotic notation.
Prove that (3n)n is not O(nn+1)
Assume (3n)n is O(nn+1), so there exist constants c and n0 such that
for all n n0
Therefore,

you need to show the process that is incorrect
Transcribed image text
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
