theory of computation

Question

The minimum number of states needed for DFA of langauge L is ________.

Comments

my dfa is corrrect? i checked it for as many accepting strings as possible

---

also the starting state is final state too

---

i think 5 is enough 

Answer 1

5 states (with one dead state, two intermediate states, and two final states).