Six '$+$' and four '$-$' signs are to be placed in a straight line so that no two '$-$' signs come together. Then,the total number of ways is:

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

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

In how many ways can a team of $10$ players be selected from $22$ players if $6$ particular players are always to be included and $4$ particular players are always excluded?

In an election,there are $5$ candidates and $3$ vacancies. $A$ voter can vote for a maximum of $3$ candidates. In how many ways can a voter cast their vote?

How many words can be formed out of the letters of the word '$EDUCATION$' such that vowels occupy the odd positions?