Min DFA states?

Question

Consider the regular language L=(00+0000)* . The minimum number of  states in any DFA accepting this languages is?

Comments

@Joshi Correct, thanks!

---

@joshi can you explain ? I thought it need 5 states

---

this language is equivalent to
L={even no. of 0’s}
so, just requires 2 states only

Answer 1

Here L = (00+0000)*

means L = {ε, 00, 0000, 000000, ......}

Minimum no. of states for DFA = 4

Comments

1 is not an input symbol here, the only input symbol is 0

---

EDIT: Yes, only input symbol is 0.