Question: Prove if the statement is true or not. If it is false prove it by giving a counterexample. If it ... 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. For all n, f(n) >= 0 and g(n) >= 0.

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