# Answer to Question #85287 in Algorithms for Mlk

Question #85287

Prove or disprove the following:

1. lg√n ∈ O(lg n) (√n means square root of n)

2. lg n ∈ O(lg√n)

3. 2n+1 ∈ O(2n)

1. lg√n ∈ O(lg n) (√n means square root of n)

2. lg n ∈ O(lg√n)

3. 2n+1 ∈ O(2n)

Expert's answer

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment