Markov chain problem.

Q1:
http://farm6.staticflickr.com/5493/10679369703_00fb8a5cd0_b.jpg

Q2:
http://farm8.staticflickr.com/7310/10679179784_81a5225009_b.jpg

Q3:
http://farm3.staticflickr.com/2855/10679074816_aaaf04f062_b.jpg

Q4:
http://farm8.staticflickr.com/7425/10679282743_d817d65f47_b.jpg

Q5: (I solved part a and b)
http://farm3.staticflickr.com/2863/10679037045_144128e957_b.jpg

Q6:
Consider a quantum mechanical system with three states. At each step a particular particle transitions from one state to a different state.

Empirical data show that if the particle is in State 1, then it is 3 times more likely to go to State 2 at the next step than to State 3. If it is in State 2, then it is 8 times more likely to go to State 3 at the next step than to State 1. If it is in State 3 then it is equally likely to go to State 1 or State 2 at the next step.

Let A be transition matrix for this markov chain. Find a31, a32, and a33 (i.e., find the last row in the transition matrix)


Anyone can teach me how to solve the above questions step by step?
thanks.