In how many ways 10 examination papers be arranged so that the best and the worst papers never come together?	Select the correct option
A) 4*6!
B) 5*8!
C) 7*5!
D) 7*8!
E) 8*9!
Required number of ways = (10-2) *(10-1)! = 8*9!   Answer is 8*9!
<result>E</result>
In how many ways 10 examination papers be arranged so that the best and the worst papers never come together?