Spend up to 30 minutes on the following:

1) Convert to an DFA the DFA you got for 

    (0|1) (0|1)* (.|<epsilon>) (0|1)*

   in the previous homework.

2) Do Appel's Question 2.5 b and c --- for c, distinguish each accept
   state with the token that would be matched if this were used in a
   lexical scanner that distinguished 4 tokens "cat", "cats", "car"
   and "cars".