Suppose, at some distance point in the future, the World Series in major league baseball becomes a best-of-n series, where n is an arbitrary odd number set by the Commissioner of Baseball in that year, based on advertising revenue. Suppose the Anteaters and the Bears are meeting in the World Series in that year, and, based on past experience, we know that in each game they play, the Anteaters have a probability p of winning; hence, the Bears have a probability of 1 − p of winning, with all games being independent. Consider a parameter, V (i, j), which is the probability that the Anteaters will have won i games and the Bears will have won j games after the two teams have played i + j against each other. Give an equation for defining V (i, j), including the special cases, V (i, 0), V (0, j), V ([n/2], j) and V (i, [n/2]), and describe an algorithm for determining the overall probability that the Anteaters will win the World Series.