Exercise 2. 1. Define a DFA whose language is {0s0 {0, 1)' I s E {0,1}*). 2. Define a 3-state NFA N which recognizes the same language. 3. Use the NFA-to-DFA construction (from class or Theorem 1.39 in Sipser) to get a DFA from 4. What are some states in the resulting DFA which you would remove (without altering the language)? Explain why your each of your removals is safe