A Of pants Pooleling4 37018 Suppose we want to know the average (or expected) number of steps it will take to go from state / to state / in a Markov chain. It can be shown that the following computation answers this question: Delete the jth row and the jth column of the transition matrix P to get a new matrix Q. (Keep the rows and columns of Q labeled as they were in P.) The expected number of steps from state i to state / is given by the sum of the entries in the column of (-Q) labeled . Robots have been programmed to traverse the maze shown in the figure below and at each Junction randomly choose which way to go. Starting from each of the other junctions, what is the expected number of moves until a robot reaches junction 37 (Round your answers to two decimal places.) from junction 1 moves moves from Junction 2 from Junction 4 moves Need Help? Qu Supp the f cofut Sobe