01 [10 pts] P.79 (P. 80 in the 2nd ed) Ex.2.5.2. Repeat Exercise 2.5.1 for the following e-NFA: 1 eps | a | b | c ---- -> p || {q,r} | {} q || {} L {p} *r || {} / {} |{q} | {r} | {r} | {p,q} | {} | {} a) Compute the e-closure of each state. b) Give all the strings of length three of less accepted by the automaton. c) Convert the automaton to a DFA