Answer:
The committes can be selected in
ways
Explanation:
The order in which the members are chosen to the committee is not important. So we use the combinations formula 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.

The two committees must be disjoint.
This means that a person cannot be part of both committes.
If there are 385 members of congress, how many ways could the committees be selected?
Since the committes are disjoint, 5(math) + 5(computer science) = 10 people will be chosen from the set of 385. So

The committes can be selected in
ways