Assertion (A) If $a_1, a_2, \ldots, a_n$ are the $n$ distinct roots of the equation $x^n-2=0$, then $1+\left(1-a_1\right)\left(1-a_2\right) \ldots \left(1-a_{n-1}\right)\left(1-a_n\right)=0$

Reason (R) If $\alpha_1, \alpha_2, \ldots, \alpha_n$ are the roots of $f(x) \equiv p_0 x^n+p_1 x^{n-1}+p_2 x^{n-2}+\ldots+p_n=0$, then the roots of

$$ f(g(x))=0 \text { are } \mathrm{g}^{-1}\left(\alpha_i\right), i=1,2,3, \ldots, n $$

The correct option among the following is

Let $S_r=\{x, y, z) / x+y+z=11, x \geq r, y \geq r$, $z \geq r, x, y, z, r$ are integers $\}$ and $n\left(S_r\right)$ represents the number of elements in $S_r$. Then $n\left(S_{2)}+n\left(S_3\right)+n\left(S_4\right)=\right.$

A certain question paper contains three parts $A, B, C$ with four questions in part $A$, five questions in part $B$ and six questions in part $C$. A student is required to answer seven questions choosing at least two questions from each part. Then the total number of different ways a student can choose his seven questions for answering, is

$p, q$ are two prime numbers. For $n=p q$, if the expansion $\left(\sqrt[4]{x^{-5}}+2 \sqrt[5]{x^5}\right)^n$ contains non-zero coefficient of $x^{-n}$ and $x^0$, then the least value of such $n$ is