1. Give the state diagrams of DFAs recognizing the following languages over = {0, 1}:

1. {w : w does not contain exactly two 1s}
2. {w : |w| 5}