Time Complexity

Question

Comments

b ???

---

Procedure ?

Answer 1

We can infer that $f(n) \geq c_1n$ and $g(n) \leq c_2f(n)$, for some $c_1,c_2$.

Let $f(n) = c_1n$.

This implies that $g(n) \leq c_2c_1n$.

Let $c_3 = c_1 \times c_2 \implies g(n) \leq c_n \implies g(n) \in O(n)$.

Comments

can you check this.where is wrong??

---

In the question, the first statement doesn't say anything about $g(n)$.

---

both of the case possible because it is only saying that g(n)=Of(n).how we consider only one case??