Answer:
He can choose 4 good hitters and 1 poor hitter in 630 different ways.
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:
is the number of different combinations of x objects from a set of n elements, given by the following formula.
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
He can choose 4 good hitters and 1 poor hitter in 630 different ways.