i am struggled by the question below, can you help me out?

(I have posted the question , please see attached, thank you)

Consider a square where we randomly choose two of its edges and connect their midpoints to form two smaller polygons. We then choose one of the two resulting polygons at random. Again, two random edges of this polygon are chosen and their midpoints are connected to form two more polygons. The process of randomly choosing one of the polygons and selecting two of its edges at random and connecting their midpoints continuous to generate a sequence of random convex polynomials. Let Y\" | 3 be the number of edges of the n' polygon thus constructed. The sequence {Ym n E N} forms a DTMC. [4 marks] Find the TPM of this DTMC, and write all communication classes of the Markov chain. Is this Markov chain irreducible? Calculate the periods of all states. [5 marks] Calculate the expected number of edges of the ram polygon constructed. 1 [8 marks] Show that the stationary distribution of the Markov Chain is P01 (1), Le. H;- = %, i: U,1,2,3