Using the Fundamental Counting Theorem, considering the cardinality of each set, it is found that n(A x B x C) = 12.
<h3>What is the Fundamental Counting Theorem?</h3>
It is a theorem that states that if there are n things, each with ways to be done, each thing independent of the other, the number of ways they can be done is:
In this problem, we have that:
- .
- .
- .
Hence, applying the Theorem:
n(A x B x C) = 3 x 2 x 2 = 12.
More can be learned about the Fundamental Counting Theorem at brainly.com/question/24314866
#SPJ1