Consider the Markov chain whose transition probability matrix is:
[
0 0 1 0 0 0
0 0 0 0 0 1
0 0 0 0 1 0
1/3 1/3 1/3 0 0 0
1 0 0 0 0 0
0 1/2 0 0 0 1/2
]
(a) Classify the states {0,1,2,3,4,5} into classes.
(b) Identify the recurrent and transient states.
(c) Compute the period of each recurrent class.
(d) Identify the ergodic states.