Chapter 2: 2.2.3, 2.2.4, 2.2.5 (draw a tree), 2.2.6, and 2.2.9 (in part d, n refers to the number of tries before generating a busy signal).
Morning session: Rob Brooks, Tegan Campbell, and Stephen Hajdu.
Afternoon session: Zach Blixt, Kevin Mehaffey, and Eric Sweet.
Please answer the following questions using analysis, not simulation.