The children's game Chutes and Ladders is based on an ancient Indian game called Snakes and Ladders (see https://en.wikipedia.org/wiki/Snakes_and_Ladders). The game is played on a 100-square board. Each player has a token and takes turns rolling a six-sided die and moving their token by the corresponding number of squares. If a player lands on a ladder, they immediately move up the ladder to a higher-numbered square. If they move to a chute, or snake, they drop down to a lower-numbered square. The finishing square 100 must be reached by an exact roll of the die (or by landing on square 80 whose ladder climbs to the finish). The first player to land on square 100 wins. The game is a Markov chain since the player's position only depends on their previous position and the roll of the die. The chain has 101 states as the game starts will all players off the board (state 0). 1. (10 points) (Without Python) The board for a modified Snakes and Ladder game is shown in the Figure.

1. The game is played with a tetrahedron (4-sided) die.

I HAVE the Transition Matrix and want a tutor to double check it then help me solve A and B

\f\f