Question 2 (20 point) By using the conversion procedure as outlined in Sipser, Figure 1.63 as a guide construct a regular expression R such that L(R) = L(N), where N is the NFA N shown in Figure 1. Your construction must indicate the steps each time when you apply the conversion procedure in your construction. bb RA Figure 1: The nfa N. Convert it to an equivalent regular expression qi (R1) (R2)* (R3) U (R2) qi qrip DR2 before after FIGURE 1.63 Constructing an equivalent GNFA with one fewer state