3.4.1: Consider the four functions fs: n2 if n is odd, and n if n is even : n2 if n is prime, and n3 if n is composite For each i and j equal to 1, 2, 3, 4,determine whether f (n) is O(f,(n)). Either give values no and c that prove the big-oh relationship, or assume that there are such values no and c, and then derive a contradiction to prove that f,(n) is not O(f,(n. Hnt: Remember that all primes except 2 are odd. Also remember that (nonprimes)