1.

The number of ways in which ten candidates \[{{A}_{1}},\ {{A}_{2}},\ .......{{A}_{10}}\] can be ranked such that \[{{A}_{1}}\] is always above \[{{A}_{10}}\] is

A. \[5\ !\]
B. \[2(5\ !)\]
C. \[10\ !\]
D. \[\frac{1}{2}(10\ !)\]
Answer» E.


Discussion

No Comment Found