2. Suppose that a weighted graph (V, E) has transition matrix W. A new graph (V, E')is constructed from (V, E) by reversing all the edges in E. That is,

if (a, b, n) E E then (b, a, n) E E' and vice versa, and the weight of the reversed edge is the same as the weight before reversing. What is the transition matrix of (V, E)? You don't need to justify your answer.

Fig: 1