I would like to help with this question please, show steps and be clear. thank you for your help. That is all the parts of the question.

2. Consider the tournament whose adjacency matrix is 0111100 0011101 0001100 T=0 0 0 01 0 0 0000011 1111001 1011000 Here, Ti}- = 1 if player i defeated player j in the tournament. A. Use software of your choice to compute T2, T4, T8, T16 - this is most easily accomplished by squaring the matrix successively, rather than by computing the powers individually. B. As you successively square the matrix, the columns should begin to converge to multiples of each other. What's happening is that the columns are converging to multiples of the dominant eigenvector. C. According to the relative values of column entries, how should the participants be ranked? D. In part C, did you find that any player who won fewer games was more highly ranked than someone who won more games