The number of sequences in which 3 players can throw a ball, so that the youngest player may not be the last is ?  Choose the correct choice
A) 3  B) 8  C) 5  D) 4  E) 10
x Not younger   The last ball can be thrown by any of the remaining 3 players. The first 6 players can throw the ball in 2P2 ways.   The required number of ways = 2(2!)   = 4   Answer:4
<result>D</result>
The number of sequences in which 3 players can throw a ball, so that the youngest player may not be the last is ?