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 event, and 4 ways to do the fourth event.

1. TRUE OR FALSE: You can add the numbers to get n(S).

2. TRUE OR FALSE: You can use the fundamental counting principle to get n(S).

3. TRUE OR FALSE: This is called a compound event.

4. Calculate how many pathways there are through the tree.