1. **Problem statement:** A bag contains five marbles: 1 blue (B), 1 red (R), and 3 green (G). Two marbles are selected without replacement. We need to list all possible outcomes using a tree diagram approach. 2. **Understanding the problem:** Since marbles are drawn without replacement, after the first marble is chosen, it is not put back. This affects the second draw's possible outcomes. 3. **Step 1 - First draw possibilities:** The first marble can be B, R, or G. 4. **Step 2 - Second draw possibilities:** After the first draw, the bag has 4 marbles left. The possible second draws depend on the first: - If first is B, remaining are R and 3 G. - If first is R, remaining are B and 3 G. - If first is G, remaining are B, R, and 2 G (since one G was taken). 5. **Listing all outcomes:** - First B: second can be R or G - First R: second can be B or G - First G: second can be B, R, or G 6. **All possible pairs (order matters since draws are sequential):** - (B, R), (B, G) - (R, B), (R, G) - (G, B), (G, R), (G, G) 7. **Summary:** There are 7 possible ordered outcomes when drawing two marbles without replacement from the bag. This completes the enumeration of all possible outcomes using the tree diagram logic.