After visiting Las Vegas over spring break, our entrepreneurial engineering student abandons his cargo hauling business and decides to take up gambling. Roulette is his game of choice because he figures that if he bets on red every spin then he has a 0.5 probability of winning. What he doesn't realize is that probability of landing on red each spin is 18/38, not 0.5. His plan is to bet 1 token(chip) each spin. If the wheel lands on red, he keeps the token he has bet and wins another one. If it doesn't land on red, he loses the token he has bet. Suppose he starts with 3 tokens. He will keep playing until he either doubles his tokens (i.e., reaches 6 tokens total) or goes broke, at which time he will leave the game.

1. Model the student's roulette experience as a terminating Markov chain. Use all positive funds balances as states, and add an additional state for going broke. Remember that absorbing states are typically given the highest state numbers and are grouped together. Provide state definitions and draw the transition diagram.