Numbers between $1$ and $10,000$ are formed using the digits $2$ and $3$ exactly once and the digit $4$ twice. If the numbers thus formed are arranged in increasing order and $x, y$ represent the ranks of $4324$ and $324$ respectively,then $x-y=$

An eight-digit number divisible by $9$ is to be formed using digits from $0$ to $9$ without repeating the digits. The number of ways in which this can be done is

Let $S = \{0, 1, 2, 3, \ldots, 100\}$. The number of ways of selecting $x, y \in S$ such that $x \neq y$ and $x + y = 100$ is

The number of ways in which four letters of the word '$MATHEMATICS$' can be arranged is given by

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}$.

$A$ question paper is divided into two parts $A$ and $B$,and each part contains $5$ questions. The number of ways in which a candidate can answer $6$ questions,selecting at least two questions from each part,is: