So I am not very good with matrices. Two questions,

1)How would I find the limiting matrix for the indicated standard form? What is the long run probability of going from each no-absorbing state to each absorbing state and the average number of trails needed to go from non-absorbing to absorbing?

------A--B--C
P=A-[1--0--0
---B--0--1--0
---C--.3-.2-.5]

2)Find the standard form for the absorbing Markov chain with the indicated transition matrix:

------A--B--C
P=A-[0--0--1
---B--0--1--0
---C--.7-.2-.1]


Thanks for the help!