U can see my answers fir part a,b,c can I please get help with the rest

11:02 5G Done stat304_assig1_2023 STAT304/STAT804 Assignment 1 Due by 25th August 2023 5pm 1. In the game Snakes & Ladders, a player has a piece which starts on the first tile. The player rolls a die and moves his/her piece on the board along the numbered tiles. If the piece lands on the head of a snake, it is immediately placed at the snake's tail. If the piece lands at the foot of a ladder, it is immediately placed at the top of the ladder. To win the game, the player's piece must land exactly on the last tile. If it does not, the remaining steps in the player's turn are played backwards. On the next roll the piece is moved forward again. Once the piece falls on the last tile, the game is over and stays in that state of completion forever. Consider the following board and assume that the die only has three faces (i.e., one can roll only 1,2, and 3). END II START (a) Denote as {Xn}ner, T = {0, 1, ...}, the position of the player's piece on the board. What is the state-space of { X}ner, S? (Hint: There are less than 9 states) (1 mark) (b) Draw a state diagram and write down the one-step probability transition matrix P. (1 mark) (c) Let Xn be the position of the player's piece at the nth turn. Is {X, }ner, T = {0, 1, 2, . .. } a finite-state, stationary, Markov chain? (2 marks) (d) Classify the states as transient, recurrent, or absorbing. List the communication classes, and indicate which communication classes are closed or not closed. Is the chain irreducible? (2 marks) A2/3 - 100% + (a) - Denote as (Xn)ner, T = 0, 1,..., the position of the players piece on the board. What is the state-space of (Xn)ner , S? (Hint: There are less than 9 states) The players piece can be any of the following states: Start position of: 0 . The positions after that: 2, 3, 4, 5, 6 . 1 isn't a state as you "immediately" go to the state of 6 . 7 isn't a state as you "immediately" go to the state of 5 . The final position, which is the winning state: 8 Therefore there are a total of 7 states in the game. (b) - Draw a state diagram and write down the one-step probability transition matrix P: 0.25 0.25 0.25 0.25 0 0 0 0.25 0 0.25 0.25 0.25 0 0 0 10 0.25 0 0.25 0.25 0.25 0 0 0.25 0.25 0.25 0.25 0 0 0 0 0 0 0 0 0 0 0 * Note the entries in the Matrix P depend on the specific layout of the board, including the positions of the snakes and ladders, as well as the probabilities as- sociated with the dice rolls. (c) - Let Xn be the position of the players piece at the nth turn. Is (X,)ner , T = (0, 1, 2, ...) a finite-state, stationary, Markov chain? Yes (Xn)ner, T = 0, 1, 2, ... is a finite-state, stationary , Markov chain. It is finite- state because the players position can only take on a finite number of values. Its stationary because the the transition probabilities do not depend on the previous positions but only on the current state. prime ustv EPIC GAMES ali O DI DD 20 O 44 F7 F10 F11 F12 F3 F6 *