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

a. {w: w does not contain exactly two l’s} 

b. {w :ΙwΙ > 5}