Problem 2 Convert the NFA M in Figure 1 into a regular expression such that L(a)=L(M). Notes: Please write the final expression below (on the "Final expression:"). In page 3, show step-by-step how you derive the final expression. For each step, (1) explain which state is being removed and (2) show the resultant intermediate FA. 0 91 1 93 DO 90 0,1 94 A 42 Figure 1: Non-deterministic finite automaton M. Here, 1 denotes the empty string (equivalent to e). Final expression: Step-by-step derivations