1. (5 points) Short Answer Questions In addition to your answer, please also briefly explain your reasoning. (a) (1 point) Let language A and B be regular. is (AUB) regular? (b) (1 point) Given a NFA N has 6 states, when converting N to GNFA what's the minimum number of states for its GNFA? (c) (1 point) Whal method can we use to show that a language is regular? (Provide at least three methods) (d) (1 point) If you convert (01 U 10) into an equivalent NFA, how many total states and accept states would the machine have? (e) (1 points) Considering the following DFA M given as its state diagram. Describe the language L of the given DFA in English 41 start- 00 142