Consider the following statement :
(i) Numberof one-one functions from set A to set B, where O(A) = m and O(B) =` n(m lt=n)` is given by `""^nP_m`
(ii) Number of ways is which 'n' people can be arranged at a circular table is `( (n-1)!)/(2)`
(iii) Number of ways of selecting atleast one thing out of the given a distinct things is `2^n - 1`
(iv) Number of ways in which distinguishable objects can be distributed into k distinguishable bins is `""^nC_(k-1) `
Then which one of the following is true?

Options

A. All the statements are true
B. All except (iii) are true
C. Only (i) and (iii) are true
D. Only (iii) is false

Answer

C