Which function best describes how the number of steps changes as the length (n) of the list increases?

Choose 1 answer:
1)2/n
2)n/2
3)n-2
4)n
5)n2

Assuming that ∀n≥n0 f(n) ≥ g(n) ≥0 and that f(n), g(n) ∈ Θ(h(n)), what can you say about the order of f(n)-g (n)?

Prove that ∀ a, b (a, b>1 ⇒ lg a n ∈Θ (lgb n)).
If a≠b, is it true 2lga n ∈ Θ (2lgb n)?