Let $g(n) = \Omega(n)$, $f(n) = O(n)$ and $h(n) = \theta(n)$ then what is the time complexity of $[g(n) f(n) + h(n)]$
I think that we can only say that time complexity is $\Omega (n)$ as we can not find upper bound from information given can figure out just lower bound.