Answer:
He can choose 4 good hitters and 1 poor hitter in 630 different ways.
Step-by-step explanation:
The order in which the hitters are chosen is not important, which means that the combinations formula is used to solve this question.
Combinations formula:
[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by the following formula.
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
In how many ways can he choose 4 good hitters and 1 poor hitter?
4 good hitters from a set of 8.
1 poor hitter from a set of 9. So
[tex]T = C_{8,4}*C_{9,1} = \frac{8!}{4!(8-4)!}*9 = 630[/tex]
He can choose 4 good hitters and 1 poor hitter in 630 different ways.
