(5) Write a code that takes a N x N transition probability matrix and a positive number n, and produces the n-th power of a transition probability matrix, presenting the output in visual form (i.e. writing the rows and columns of the matrix). 4), the Use this to calculate p, p5, p10, p20 and p 40 for: the Gambler's ruin (with M = Ehrenfest chain (with N = 4), and the Wright-Fisher model (with N = 4). For each matrix, what pattern do you see as n increases?.