1. Suppose that two teams play a series of games that ends when one of the teams has one i number of games. Suppose that each game played is, independently, won by team A with probability p. Find the expected number of games that are played when (a) i = 2 and when (b) i = 3. Show also in both cases that this number is maximized when p = ½.

2. Consider problem 1 with i = 2. Find the variance of the number of games played and show that this number is maximized when p = ½.

2. Consider problem 1 with i = 2. Find the variance of the number of games played and show that this number is maximized when p = ½.

### Recently Asked Questions

- Section 3: The local DNS Cache on Your Computer Background Information on ipconfig and ifconfig ipconfig (for Windows) and ifconfig (for Linux/Unix/Mac)

- There are 3,000 students majoring in computer Science. By applying generalized pigeonhole principle, determine the minimum number of Computer Science students

- add a recursive method that returns the reverse of a string. For example, for the parameter string "Java", your method would return the string "avaJ". The