Question 2 a) Design an NFA automaton N that accepts the language a* b+ b) Design another NFA automaton N2 that accepts the complement a* b+ c) Form the union automaton N of N, and N2 (ie N = N1 U N2) d) Use the subset construction to convert the N in (c) into its equivalent DFA