WDo THiS : Try to draw a Markov chain (Markov matrix) for the above systern of equations. Be prepared to share your diagram with the class. A Markov chain can be represented as a Markov transition model of the form Ax=b. Where A is your probability tranisition matrix (often represented as a P instead of an A ). x is the state before the transition and b is the state after the transition. DQUESTON: Generate a Markov transition model represented as a matrix P of the form: Current Room P=p11p21p31p12p22p12p13p21p32NextRoom Where P= are probability transitions of the cat moving between rooms (from room n to room m ): Afpout your ansiver here P = np.natrix ([10,2/3,1/3],[2/3,8,1/3],[1/2,1/2,0]]) from answercheck inport checkanswer checkanswer.matrix(P, '1e01a6fae7727caf8ceg5226b765542c'); Checkiarning: Matrix contains negative values for zero... Converting to positive values of zero using A[A=]=01