Let pxnqně0 denote a markov chain with state space s “ t1, 2, 3, 4u and transition probability matrix p “ ¨ ˚˚˝ 1 2 1 2 0 0 1 ´ p 0 p 0 0 1 2 0 1 2 0 0 1 0 ˛ ‹ ‹‚ where p p r0, 1s is some arbitrary probability. (a) provide the transition graph. (b) determine all communication classes. which communication classes are closed