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$
$A,B,D$
$A,B,C$
$A,B$
$A,D$
How many words, with or without meaning, each of $2$ vowels and $3$ consonants can be formed from the letters of the word $\mathrm{DAUGHTER}$ ?
In how many ways can a committee consisting of one or more members be formed out of $12$ members of the Municipal Corporation
A group consists of $4$ girls and $7$ boys. In how many ways can a team of $5$ members be selected if the team has no girl?
$m$ men and $n$ women are to be seated in a row so that no two women sit together. If $m > n$, then the number of ways in which they can be seated is
The number of matrices of order $3 \times 3$, whose entries are either $0$ or $1$ and the sum of all the entries is a prime number, is$....$