The number of words not starting and ending with vowels formed, using all the letters of the word $'UNIVERSITY'$ such that all vowels are in alphabetical order, is

If ${ }^{1} \mathrm{P}_{1}+2 \cdot{ }^{2} \mathrm{P}_{2}+3 \cdot{ }^{3} \mathrm{P}_{3}+\ldots+15 \cdot{ }^{15} \mathrm{P}_{15}={ }^{\mathrm{q}} \mathrm{P}_{\mathrm{r}}-\mathrm{s}, 0 \leq \mathrm{s} \leq 1$ then ${ }^{\mathrm{q}+\mathrm{s}} \mathrm{C}_{\mathrm{r}-\mathrm{s}}$ is equal to .... .

The total number of different combinations of one or more letters which can be made from the letters of the word ‘$MISSISSIPPI$’ is

If $^8{C_r}{ = ^8}{C_{r + 2}}$, then the value of $^r{C_2}$ is

Let $A=\left[a_{i j}\right], a_{i j} \in Z \cap[0,4], 1 \leq i, j \leq 2$. The number of matrices $A$ such that the sum of all entries is a prime number $p \in(2,13)$ is $........$.

If $x,\;y$ and $r$ are positive integers, then $^x{C_r}{ + ^x}{C_{r - 1}}^y{C_1}{ + ^x}{C_{r - 2}}^y{C_2} + .......{ + ^y}{C_r} = $