Exercise 1 (Deterministic) Find a dfa that accepts all the strings on {a,b} except those that contain the substring bbb. Exercise 2 (Deterministic) On the alphabet {a,b}, find a dfa that accepts all strings with at 0 or more b's and 2 or more a's. The a's do not have to be next to each other; the b's do not have to be next to each other. Exercise 3 (Deterministic) On the alphabet {a,b}, find a dfa that accepts L={bman:m>=1 and m=1}