Using the Fundamental Counting Theorem, it is found that there is a total of 8 possible outcomes.
<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:
![N = n_1 \times n_2 \times \cdots \times n_n](https://tex.z-dn.net/?f=N%20%3D%20n_1%20%5Ctimes%20n_2%20%5Ctimes%20%5Ccdots%20%5Ctimes%20n_n)
In this problem, 3 coins will be flipped, each with two possible outcomes, hence:
![n_1 = n_2 = n_3 = 2](https://tex.z-dn.net/?f=n_1%20%3D%20n_2%20%3D%20n_3%20%3D%202)
N = 2 x 2 x 2 = 8.
More can be learned about the Fundamental Counting Theorem at brainly.com/question/24314866
#SPJ1