We know that
• The total is nine starters.
,
• The coach wants to choose three.
Given that the player cannot include repetition, we solve this problem as a combination because the order does not matter.
Where n = 9, and r = 3. Let's replace these values.
Hence, there are 84 different ways to choose the first three.