If all the letters in the word $PRINCE$ are rearranged in alphabetical order,then how many letter$(s)$ will remain unchanged?

Arrange the given words in alphabetical order and choose the one that comes first.

The number of letters skipped between adjacent letters in the series follows the order of $2, 5, 7, 10$. Which of the following series observes the rule given above?

In the following list of letters,how many $O$'s are followed by $Q$'s but not preceded by $D$'s?
$D, O, Q, O, D, Q, O, D, O, D, Q, D, O, Q, D, S, D, Q, P$
$O, Q, D, S, S, S, D, O, Q, O, Q, D, O, Q, D, D, O, Q$

$A$ group of letters is given which are numbered $1, 2, 3, 4,$ and $5$. Below are given four alternatives containing combinations of these numbers. Select the combination of numbers so that the letters arranged accordingly form a meaningful word.
$R, A, C, E, T$
$1, 2, 3, 4, 5$

Find which one word cannot be made from the letters of the given word.
$CONTEMPORARY$