Probability and Stochastic Processes

QUESTION 5 Consider the following transition probability matrix of a discrete Markov chain with ve states 0, 1, 2, 3 and 4. 0 1 2 3 4 1 i a f 0 0 P: 2 E 0 E 0 0 3 o 0 0 4 o 0 0 % (5.1) Draw a diagram indicating communication between the states. (5) (5.2) List the classes of the Markov chain. (5) (5.3) Determine the states that are recurrent and the states that are transient. For each classica- tion, explain your answer. (5) (5.4) List the absorbing states if they exist. Explain your answer. (2)