Are the following two statements true or false? If a statement is true, provide a formal proof based on the definitions of the order notations. If a statement is false, provide a counterexample and explain it. Functions f and g are positive functions. a) If h(n)=(1) and f(n)=(g(n), then f(n)=(h(n)g(n)). We assume that h(n)>0 for all n. b) If f1(n)=O(g1(n)),f2(n)=O(g2(n)) then f1(n)f2(n)=O(g1(n)g2(n)). We assume that f1(n)f2(n)0 and g1(n)g2(n)0 for all n