[" mber of ways in which "10" candidates "A_(1),A_(2).......A_(10)" can be ranked so that "A_(1)" is always ab "],[qquad A]

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

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

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

Find the number of ways in which 10 condidates A_(1),A_(2),......,A_(10) can be ranked so that A_(1) is always above A_(2) ,

Find the number of ways in which 10 condidates A_(1),A_(2),......,A_(10) can be ranked so that A_(1) is always above A_(2) ,

The number of ways in which 10 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.(1)/(2)(10!)

The number of ways in which ten candidates A_1, A_2, ...., A_(10) can be ranked so that A_1 is always above A_2 is

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

The number of ways in which ten candidates A_(1), A_(2), .. .., A_(10) can he ranked, if A_(1) is always above A_(2) is