Problem 3 ( 3 pts each part): Let A be the language accepted by the DFA M1 and B be the language accepted by the DFA M2 (see the state diagrams below). (a) Draw a state diagram of an NFA N1 accepting AUB (union) (b) Draw a state diagram of an NFA N2 accepting AB (concatenation) (c) Draw a state diagram of an NFA N3 accepting A (star operation)