Using the combination formula, it is found that the committee can be selected in 1,211,760 ways.
Combination formula:
[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:
They are independent, so we can just multiply them, thus:
[tex]T = C_{18,2} \times C_{12,2} \times C_{10,3} = \frac{18!}{2!16!} \times \frac{12!}{2!10!} \times \frac{10!}{3!7!} = 1211760[/tex]
The committee can be selected in 1,211,760 ways.
A similar problem is given at https://brainly.com/question/24650047