Convert the NFA M in Figure 1 into a regular expression such that L() = L(M). Notes: Please write the final expression below. In page 3, show step-by-step how you derive the final regular expression. For each step, explain which state is being removed and show the resulting (intermediate) FA.

Figure 1: Non-deterministic finite automaton M

9 0