If $_n{P_4} = 24 \times \binom{n}{5}$,then $n = \dots$

Match the items of List-$I$ to the items of List-$II$:

	List-$I$		List-$II$
$(A)$	The number of ways of not selecting $(n-r)$ things from $n$ different things	$(I)$	$1+n+{ }^n C_2+\ldots+{ }^n C_r$
$(B)$	$(n-r+1) \cdot{ }^n C_{r-1}$	$(II)$	$(r+1) \cdot{ }^n C_{r+1}$
$(C)$	The number of ways of selecting at least $(n-r)$ things from $n$ different things	$(III)$	$r\left({ }^n C_r\right)$
$(D)$	$(n-r)\left({ }^{n-1} C_{r-1}+{ }^{n-1} C_r\right)$	$(IV)$	$2^n-1-n-{ }^n C_2-\ldots-{ }^n C_r$
		$(V)$	${ }^n C_{n-r}$

The correct match is:

The number of words that do not start and end with vowels,formed using all the letters of the word $'UNIVERSITY'$ such that all vowels are in alphabetical order,is

Among the inequalities below,which ones are true for all natural numbers $n > 1000$?
$I. n! \leq n^n$
$II. (n!)^2 \leq n^n$
$III. 10^n \leq n!$
$IV. n^n \leq (2n)!$

The number of four-lettered words that can be formed from the letters of the word $MAYANK$ such that both $A$'s are included but never together,is equal to:

Consider the following statements:
$i.$ The number of ways of placing $n$ distinct objects in $k$ distinct bins $(k \leq n)$ such that no bin is empty is ${}^{n-1}C_{k-1}$.
$ii.$ The number of ways of writing a positive integer $n$ as a sum of $k$ positive integers is ${}^{n-1}C_{k-1}$.
$iii.$ The number of ways of placing $n$ distinct objects in $k$ distinct bins such that at least one bin is non-empty is ${}^{n-1}C_{k-1}$.
$iv.$ ${}^nC_k - {}^{n-1}C_k = {}^{n-1}C_{k-1}$.