**If you attend class on 1/25, you will have a chance to do this assignment in-class for the C**

_{4}gradeThese questions use the following state machine:

- Draw out an equivalent finite automaton to the given one after applying the ε-elimination technique described in class.
- Is the state machine an NFA (non-deterministic finite automaton) or DFA (deterministic finite automaton)?
- If the machine is a DFA, create an NFA that recognizes the same language. If the machine is an NFA, create a DFA that recognizes the same language.

Turn your work in on Canvas to the C

Do all of the work described above. Additionally, show the ε-closure for each state in the above state machine.