discreet mathematics: Can you tell me which of the following statements is false? A. There are n^m functions from a set of n elements to a set of m elements. B. Combinations C(n,r) are symmetrical in r with respect to the point r=n/2. C. If S is a finite set, S has 2|S| subsets. D. An injective function from a set of n elements to a set of n elements is automatically surjective. E. If a procedure can be broken down into a sequence of two tasks, and if there are n ways to do the first task, and m ways to do the second task, then there are nm ways to do the procedure. F. A finite set with n members has C(n,k) subsets of size k. G. If n is a nonnegative integer, then the alternating sums of all the C(n,k) are 0. H. If n is a nonnegative integer, then the sum of all the C(n,k) is 2^n. I. If a task can be done either in one of n ways or in one of m ways, then there are n m ways to do the task. J. If there are 2n+1 objects in n boxes, then at least one box must contain at least 3 objects. K.If n and k are positive integers withnk, then C(n+1,k) = C(n,k) + C(n,k+1). L.There are n! bijections from a set with n elements to itself. M.If n and r are nonnegative integers andrn, then C(n,r) = P(n,r)/r!. N.A surjective function from a set of n elements to a set of n elements is automatically injective . O.The cardinality of a cartesian product of sets is the product of the cardinalities of the individual sets.