How many words can be formed using the letters of the word $INDEPENDENCE$,such that all vowels always come together?

How many five-digit numbers can be formed using the digits $2, 0, 4, 3, 8$ if repetition of digits is not allowed?

The number of integers between $1$ and $10^{10}$ (inclusive) that contain the digit $1$ is:

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

$3$ boys $B_1, B_2, B_3$ and $6$ girls $G_1, G_2, . . . , G_6$ are to be seated in a row. The number of ways they can be seated such that $B_1, B_2$ are separated and $G_1, G_2$ are also separated is equal to:

The number of words (with or without meaning) that can be formed from all the letters of the word "$LETTER$" in which vowels never come together is