Consider the DFSM M below. Use the algorithm from class to find a regular expression r such that L(R) = L(M). You should calculate all of the r_ijk for k=0 and k=1. For k>1, you are only required to calculate as many of the r_ijk as needed to do the recursive steps that the algorithm actually needs to get the answer. Be explicit about the ones that you do calculate.

Start 91 1 0 93 92 0, 1