In a tree diagram, you have 4 ways to do the first event, 3 ways to do the second event , 5 ways to do the third and 4 ways to do the fourth. For each of the following state whether it is true or false and explain why. 1. This is called a compound event 2. There are 240 different pathways through the tree 3. You can add the numbers to get n(S) 4. You can use the fundamental counting principle to get n(S) 5. Drawing a tree diagram is the most efficient way to solve probability problems associated with these events 6. There are 16 total pathways for n(S)