2.5.6 Exercises for Section 2.5 *Exercise 2.5.1: Consider the following e-NFA. Cl *T a) Compute the e-closure of each state. b) Give all the strings of length three or less accepted by the automaton. c) Convert the automaton to a DFA