Consider two casses, A and 8 , playing "coin coss" until one of the classes wins n games. Assume that the probability of A, cossing coin "head" is the same for cach game and equal to p, and the probablity of A tossing coin "tair is 1-p. (Hence, there are no bes) Let PQJ be the probability of A winning the series it A needs i mort coin tosses to win the serles and B needs j more coin tosses to win the series. Set up a recurrence relotion for pito that can be used by a dynamic progratrning olgorithm P(I)=pP(1.])+(1p)P(4)1)P(j+1/+1)=pP(M)+(1p)P(9)P($)=(1p)P(01.]pP(41)P()=pP(1)1)+(1p)P(1/1)P(1L+1)=pP()1D+(1+p)P(1)