Let S and T be finite sets with n and m elements, respectively. (a.) If m is greater than or equal to n, how many injective (one-to-one) functions F: S---> can be defined? (b.) If m=n, how many surjective (onto) functions f: S---> T can be defined? Solution n*m n^2.