Can anyone please help me with question one

Question 6* A "Stepping Stone" model is a special kind of Markov process which has applications in several areas, including genetics. The concept is an m xn grid of squares (the stepping stones) each of which can be one of k colours, so there are kmn states. At each time step a square is chosen at random (equal probabilities) and takes on the colour of one of its up to eight neighbours, also chosen at random. If you wait long enough, all squares will be the same colour. A 2-colour simulator can be found at https://math . dartmouth. edu/archive/m20x11/public_html/test . html Consider a 2x2 grid with two colours, black(B) and white(W). Every stone is a neighbour of all the others. Instead of the full set of 24 states, consider the five 'summary' states O, 1), 2, 3, 4 representing the number of white stones. e.g. (1 = { RE, BB, ER, BW} (a) Write our the transition matrix T for this 2 3 4 5-state Markov process. You do not have to justify your matrix, T = but as a check, you should find that the FW N - O centre entry, representing the probability of staying in state (2, is 3. (b) Justify your value for the probability of the transition (3 - 2 (c) Use the shortcut method with the help of the Gauss-Jordan Elimination tool in Matrix Reshish to try to find a steady state vector for this Markov Process. What output is generated? (d) What does your answer to (c) mean about the stepping stones