== This state diagram defines an NFA M ({90, 91, 92), 6, 40, {q0, q1}) accepting some language L over the alphabet = {0, 1}. Step by step follow the algorithm to trans- form this NFA into an equivalent regular ex- pression via a sequence of GNFA's. 0 {90} *91 {0} {9192} 92 V {91}