9 votes 9 votes If $f(n) = O(g(n))$ and $f(n) = \Omega(g(n)),$ then it is always true that $f(n) = o(g(n)).$ $f(n) = \theta(g(n)).$ $f(n) = \omega(g(n)).$ both A and B are always true. Programming in C goclasses_wq9 goclasses algorithms asymptotic-notation 1-mark + – GO Classes asked May 4, 2022 recategorized Jun 28, 2022 by Lakshman Bhaiya GO Classes 483 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
11 votes 11 votes Answer is option B and we will see how options A,C are not correct [ Jiren ] answered May 5, 2022 [ Jiren ] comment Share Follow See all 0 reply Please log in or register to add a comment.
6 votes 6 votes Answer to the question is Option B sklolla answered May 5, 2022 sklolla comment Share Follow See all 0 reply Please log in or register to add a comment.