The combinatorial coefficient \( \mathrm{C}(\mathrm{n}, \mathrm{r}) \) is equal to
(A) number of possible subsets of \( r \) members from a set of \( n \) distinct members.
WV
(B) number of possible binary messages of length \( \mathrm{n} \) with exactly \( \mathrm{r} \) 1s.
(C) number of non decreasing 2-D paths from the lattice point \( (0,0) \) to \( (r, n) \).
(D) number of ways of selecting \( \mathrm{r} \) things out of \( \mathrm{n} \) different things when a particular thing is always included plus the number of ways of selecting \( r \) things out of \( n \), when a particular thing is always excluded.
π²PW App Link - https://bit.ly/YTAI_PWAP
πPW Website - https://www.pw.live
0