Please answer the following Markov Chain problem:

4. (30 total points): A player goes into a casino to gamble on roulette. Her objective is to have fun, not to make a lot of money, so she employs a simple strategy. She will get $50 in $10 chips (i.e., 5 chips), bet one chip at a time on either red or black according to her hunch at the time, and play until she either runs out of chips or has doubled her initial stake (i.e., has 10 chips), at which time she will declare herself to be a \"winner,\" and go home to share her winnings with her partner. In roulette, there are 18 red, 18 black, and 2 green slots on the wheel. The ball is equally likely to land in any one of the slots. The \"house\" (the casino itself) wins all bets if the ball lands in a green slot. (a) (5 points): Write out the single-step transition matrix for a Markov chain model that tracks the player's gains and losses, arranged in the standard form (block-matrix form) for this kind of Markov chain. (You may want to st art by drawing the transition diagram, but the question asks for the matrix.) Also describe in words the contents of each of the matrix blocks