3.5. An urn initially contains a single red ball and a single green ball. A ball is drawn at random, removed, and replaced by a ball of the opposite color, and this process repeats so that there are always exactly two balls in the urn. Let X be the number of red balls in the urn after n draws, with Xo = 1. Specify the transition probabilities for the Markov chain {X_n}.