Solution

Correct answer is Option 3Explanation:

Omega Notation, Ω

The notation Ω(n) is the formal way to express the lower bound of an algorithm's running time.

It measures the best case time complexity or the best amount of time an algorithm can possibly take to complete.

For example, for a function f(n)

Ω(f(n)) ≥ { g(n) : there exists c > 0 and n0 such that g(n) ≤ c.f(n) for all n > n0. }

According to Transitive Property

 f(n) = o(g(n)) and g(n) = o(h(n)) ⇒ f(n) = o(h(n)) is Correct