Alice, Bob, and Carol play a chess tournament. The first game is played between Alice and Bob. The player who sits out a given game plays next the winner of that game. The tournament ends when some player wins two successive games. Let a tournament history be the list of game winners, so for example ACBAA corresponds to the tournament where Alice won games 1, 4, and 5, Caroll won game 2, and Bob won game 3.

Required:
a. Provide a tree-based sequential description of a sample space where the outcomes are the possible tournament histories.
b. We are told that every possible tournament history that consists of k games has probability 1/2k, and that a tournament history consisting of an infinite number of games has zero prob- ability. Demonstrate that this assignment of probabilities defines a legitimate probability law.
c. Assuming the probability law from part (b) to be correct, find the probability that the tournament lasts no more than 5 games, and the probability for each of Alice, Bob, and Caroll winning the tournament.