(a) Let f(n)=3n3+n2 and g(n)=n3n2. Show that f(n) (g(n)). Give appropriate choices of constants c1,c2 and n0 such that c1g(n)f(n)c2g(n) for all nn0. Alternatively, you can prove this by first showing f(n)O(g(n)) and then showing g(n)O(f(n)). Again, you will show each of these by picking appropraite constants. (b) Let f(n)=(n2+n)(logn+2)2. Write f(n) in terms of the simplest big-O class. Prove this by providing c and n0