How many numbers between $5000$ and $10,000$ can be formed using the digits $1, 2, 3, 4, 5, 6, 7, 8, 9$ each digit appearing not more than once in each number

For non-negative integers $s$ and $r$, let

$\binom{s}{r}=\left\{\begin{array}{ll}\frac{s!}{r!(s-r)!} & \text { if } r \leq s \\ 0 & \text { if } r>s\end{array}\right.$

For positive integers $m$ and $n$, let

$(m, n) \sum_{ p =0}^{ m + n } \frac{ f ( m , n , p )}{\binom{ n + p }{ p }}$

where for any nonnegative integer $p$,

$f(m, n, p)=\sum_{i=0}^{ p }\binom{m}{i}\binom{n+i}{p}\binom{p+n}{p-i}$

Then which of the following statements is/are $TRUE$?

$(A)$ $(m, n)=g(n, m)$ for all positive integers $m, n$

$(B)$ $(m, n+1)=g(m+1, n)$ for all positive integers $m, n$

$(C)$ $(2 m, 2 n)=2 g(m, n)$ for all positive integers $m, n$

$(D)$ $(2 m, 2 n)=(g(m, n))^2$ for all positive integers $m, n$

In how many ways a team of $10$ players out of $22$ players can be made if $6$ particular players are always to be included and $4$ particular players are always excluded

At an election, a voter may vote for any number of candidates, not greater than the number to be elected. There are $10$ candidates and $4$ are of be selected, if a voter votes for at least one candidate, then the number of ways in which he can vote is

The number of ways of dividing $52$ cards amongst four players equally, are

In a touring cricket team there are $16$ players in all including $5$ bowlers and $2$ wicket-keepers. How many teams of $11$ players from these, can be chosen, so as to include three bowlers and one wicket-keeper