Using the combination formula, it is found that there are 16,800 ways for them to do it.
[tex]C_{n,x}[/tex] is the number of different combinations of x objects from a set of n elements, given by:
[tex]C_{n,x} = \frac{n!}{x!(n-x)!}[/tex]
In this problem, we have that:
Hence the number of ways is:
[tex]N = C_{10,1}C_{9,3}C_{6,3}C_{3,3} = \frac{10!}{1!9!} \times \frac{9!}{3!6!} \times \frac{6!}{3!3!} \times \frac{3!}{3!0!} = 16800[/tex]
More can be learned about the combination formula at https://brainly.com/question/25821700
#SPJ1