1. Consider the following NFA (the alphabet is 0,1)): 0,1 a) Describe, in English, what strings this machine accepts. b) Find all reachable, closed subsets of Q = {go, q1.92.93). [Hint: There are three of them.] c) Indicate, by a diagram or transition table, the DFA that uses these subsets as states and accepts the same language. d) Show that no smaller DFA can accept this language. Hint: Use Myhill-Nerode.]