Question

Match the column :

Column I		Column II
A	Number of increasing permutations of $m$ symbols are there from the $n$ set numbers $\left\{a_1,a_2,\dots ,a_n\right\}$ where the order among the numbers is given by $a_1<a_2<a_3<\dots .a_{n-1}<a_n$ is	P	(P) $n^m$
B	There are $m$ men and $n$ monkeys. Number of ways in which every monkey has a master, if a man can have any number of monkeys	Q	${}^m{C}_n$
C	Number of ways in which $n$ red balls and $(m-1)$ green balls can be arranged in a line, so that no two red balls are together, is (balls of the same colour are alike)	R	${}^n{C}_m$
D	Number of ways in which ' $m$ ' different toys can be distributed in ' $n$ ' children if every child may receive any number of toys, is	S	$m^n$

• A. 1. $A\to R;B\to S;C\to Q;D\to P$
• B. 1. $A\to R;B\to S;C\to Q;D\to Q$
• C. 1. $A\to R;B\to S;C\to Q;D\to R$
• D. 1. $A\to R;B\to S;C\to Q;D\to S$

Answer 1

Answer: (A)

Correct answer is (a) 1. $A\to R;B\to S;C\to Q;D\to P$