7. (9 points) Consider the two NFAs M and M2 given in Figure 6 and Figure 7, respectively. 1 94) 91 92 93 0 0 1 95 96 Figure 6: An NFA M for Question 7. Figure 7: An NFA M2 for Question 7. Let A be the language recognized by M and B the language recognized by M2. In class, we studied methods to construct NFAs for regular operations of regular languages. Following those methods, answer the following questions. (a) Construct an NFA for AUB and give the state diagram. (b) Construct an NFA for Ao B and give the state diagram. (c) Construct an NFA for A* and give the state diagram.