In how many ways $5$ speakers $S_1,S_2,S_3,S_4$ and $S_5$ can give speeches one after the other if $S_3$ wants to speak after $S_1$ & $S_2$

How many chords can be drawn through $21$ points on a circle?

$^{20}C_1 + 3 ^{20}C_2 + 3 ^{20}C_3 + ^{20}C_4$ is equal to-

Each of the $10$ letters $A,H,I,M,O,T,U,V,W$ and $X$ appears same when looked at in a mirror. They are called symmetric letters. Other letters in the alphabet are asymmetric letters. How many three letters computer passwords can be formed (no repetition allowed) with at least one symmetric letter ?

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$