\begin{pmatrix} 0&0&.2&.8&0\\ 0&0&0&.9&.1\\ .6&0&0&0&.4\\ .2&.8&0&0&0\\ 0&.9&.1&0&0 \end{pmatrix}
Question: Suppose the Markov Chain Starts at state C. What is the expected number of visits to state B before reaching state A.
My professor showed several ways to solve problems similar to these but I am on with this one.
I have tried put the matrix into canonical form and using that to solve for the Q matrix, but I am running into issues doing that.