If $n$ is an integer with $0 \leq n \leq 11$,then the minimum value of $n!(11-n)!$ is attained when a value of $n$ equals to

If all possible $4$-digit numbers are formed by choosing $4$ different digits from the given digits $1, 2, 3, 5, 8$,then the sum of all such $4$-digit numbers is:

An examination has $3$ multiple-choice questions,and each question has $4$ options. If a student passes only if they answer all questions correctly,in how many ways can they fail?

The last two digits of $2015! + 3^{2015}$ are:

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

Two packs of $52$ cards are shuffled together. The number of ways in which a man can be dealt $26$ cards so that he does not get two cards of the same suit and same denomination is