6. [14 points] Study the NFA described by the following transition table. The start state is A: the accept state is G. An empty entry indicates that there is no transition. (Eg., there's no transition from B labeled e.) The entry D. E for state D on input x means that there are two arrows labeled x, one from D to D and one from D to E State Y 2 * F DE G CEF HC (The start state is A: the single accept state is G.) a. b. [3 points] Check the table for error states (states that can't possibly lead to an accepting state) and drop them from the NFA. (This will create more "Stuckconfigurations.) Show the new transition table. 5 points) Take the e-closure of the result of part (a) to get an equivalent e-free NFA Show the new transition table. 16 points) Take the result of part (b) and use the set-of-states algorithm to calculate an equivalent DFA. (You can leave empty table entries empty; we'll treat them as implicitly going to an error state.)