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

A student is to answer $10$ out of $13$ questions in an examination such that he must choose at least $4$ from the first five question. The number of choices available to him is

In an examination there are three multiple choice questions and each question has $4 $ choices. Number of ways in which a student can fail to get all answers correct, is

The number of ways in which we can select three numbers from $1$ to $30$ so as to exclude every selection of all even numbers is

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$

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