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