Answer:
1260 ways
Explanation:
We want to arrange n people into x roles.
is the number of people for the first role.
is the number of people for the second role.
is the number of people for the xth role.
The total number of arrangents is:
![T = (n!)/(m_(0)!m_(1)!...m_(x)!)](https://img.qammunity.org/2021/formulas/mathematics/college/1oeu0xzm49j8zqsub2tkbrbgcwv317ct91.png)
In this question:
9 people
Team of 4
Team of 3
Team of 2
How many ways:
![T = (9!)/(4!3!2!) = 1260](https://img.qammunity.org/2021/formulas/mathematics/college/nq08xxzzx1ztzu90u99jmvya6l9a03da5a.png)