Recall that the probability of an event $\,E\,$ is denoted by $\,P(E)\,$.
MULTIPLICATION COUNTING PRINCIPLE
If there are $\,F\,$ choices for how to perform a first act,and for each of these $\,F\,$ ways, there are $\,S\,$ choices for how to perform a second act, then there are $\,F\cdot S\,$ ways to perform the acts in succession. (The idea extends to more than $\,2\,$ acts.) The idea is illustrated by the diagram at right. If there are $\,2\,$ piles, with $\,3\,$ in each pile, then the total is $\,2\cdot 3 = 6\,$. 
On this exercise, you will not key in your answer. However, you can check to see if your answer is correct. 
PROBLEM TYPES:
