convert the NFA N_d to an equivalent regular expression R_d .

3. (25 point) Apply the technique as shown in Chapter 1, section 3 (Sipser) to convert the NFA Nd to an equivalent regular expression Rd Your answer should provide, all the intermediate steps as in the example 1.68 from our text. 0 0 0 q1 q2 q3 Figure 1: The NFA Nd, where e repre- sent the empty string EXAMPLE 1.68 In this example, we begin with a three-state DFA. The steps in the conversion are shown in the following figure. aa U b ab /baUa (baUa)(aaUb)*Ue a(aa U b)*ab U b (baUa) (aa U b)*ab U bb (a(aaUb)*abUb) (baUa)(aaUb)*abUbb)*(baUa) (aaUb)*UE)Ua(aaUb)*