Question 1 (25 points) (a) (5 pts) State the full definition of a Nondeterministic Finite Automaton (NFA); in particular the domain and range of the transition function and the extended transition function SE and the condition for an NFA to accept a string u 3* in terms of SE and the set of final states F. (6) (3 pts) State whether the NFA A below is a DFA with your reasons. 1 and 4 are the final states. 1 A>1 0 1 1 1 3 1 (c) (12 pts) Compute a minimal state DFA C that is equivalent to the NFA A in part (b). (d) (5 pts) Try to express the language accepted by A above in simple natural language