Prove if the statement is true or not. If it is false prove it by giving a counterexample. If it is true, use the formal definitions of big-O, big-Omega, and big-Theta to prove it. All problems, For all n, f(n) >= 0 and g(n) >= 0. 15.

1) Time complexity of T(n) = T(3n/4) + T(n/4) +n can be written as Omega(nlogn)

2) f(n)+g(n) = O(max(f(n),g(n)))

3) If f(n) = Omega(g(n)) then g(n) = O(f(n))

Thank you :)