Design NFA N_a and a NFA N_b such that L(N_a) = B₁^* U B₂ and L(N_b) = B₂^*. B₃

2. (20 point) By using the NFAs you have constructed in the first question, apply the standard methods as desribed in in Sipser (Figure 1.46, 1.48 and 1.50) to design NFA Na and a NFA N, such that (Na) = B UB2 and L(N)=B-B3 Your answer should provide, for each DFA, a finite state diagram where all the states, the starting state, all of the accepting states and all the transitions (with the corresponding labels) are dis- played/drawn clearly. Show intermediate steps. Final stathe: z94 wlevem initial-st,te.eoAkr (10 N2 N2 FIGURE 1.46 Construction of an NFA N to recognize Ai U A2 FIGURE 1.48 Construction of N to recognize A o A2 FIGURE 1.50 Construction of N to recognize A