6. [20 points) NFA to regular expression. This state diagram defines an NFA M = ({90,91,92}, 2,8,90, {90,92}) accepting some language L over the alphabet 9 = {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. 8 0 1 *90 {41} {90) 91 {9} {91,92} * 42 0 {91}