Consider a backgammon match with 25 games, each of which can have one of two outcomes: win (1 point), or loss (0 points). Find the number of all possible distinct score sequences under the following alternative assumptions. (a) All 25 games are played. (b) The match is stopped when one player reaches 13 points.
