Convert the NFA M in Figure 1 into a regular expression a 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. 90 94 q2 Figure 1: Non-deterministic finite automaton M. Here, denotes the empty string (equivalent to e)