If f(n) & g(n) are asymptotically non-negative functions, then which of the following statements are TRUE?

I. max (f(n), g(n)) = θ (f(n) + g(n))

II. o(g(n)) \( \cap \) ω (g(n) ≠ { }

III. If the best-case running time of an algorithm is Ω (g(n)) & worst case running time is O(g(n)) then running time of an algorithm is θ(g(n))