Exams › GATE › Engineering Mathematics
Correct answer: f ∈ O(g)
The statement f ∈ O(g) is true because the function f(n) = n grows at a rate that is asymptotically less than or equal to the growth rate of g(n) = n², meaning there exists a constant C such that f(n) is bounded above by C * g(n) for sufficiently large n.
⚔️ Practice GATE Engineering Mathematics free + battle 1v1 →