1.

The number of ways in which 10 candidates A_(1),A_(2),A_(3),.........,A_(10) can be ranked so that A_(1) is always above A_(10) is

Answer»

5!
2(5!)
10!
`1/2(10!)`

ANSWER :D


Discussion

No Comment Found

Related InterviewSolutions