Hi!

I have the following exercise:
"Draw the deterministic finite automata using a state diagram so that accepts the language {λ ε {a,b}*: each a in the word λ appears only after or before a b}."

How many states do I have??