i need part c answer in 40 mins thanks

1. Let (X0,X1,) be the Markov chain on state space {1,2,3,4,5,6} with X0=1 and transition matrix: 1/201/30001/41/4000001/41/30001/40001/21/201/201/201/2001/31/21/20 Let T=min{n:Xn4} (a) Say, with reasons, whether this chain has any absorbing states and whether it is irreducible. (b) Explain how to reduce the problem of finding E(T) to a question about absorption in a Markov chain with 4 states. You should specify what this smaller chain is. (c) Use part (b) to determine E(T). Given that (a) Let pi=1 hore in our exumpie pig =1 the given chain has not any absorling states and the chain is not erreducible because every state does not communicate with every other state. (b) Let T=min{n:xn4 An obsorking state is a state that, once entend, carnot be left. Pis =1 nere in our ox: Pisfl the given chain has notany absorbing states transitionmatrix=1/201/301/41/40001/41/301/4000 the chain is not erreduceble because vitery state does not communicate with every othor stat