regular to dfa

Question

Consider the below given regular expression
(0+1+ϵ)(0+1+ϵ)(0+1+ϵ)(0+1)(0+1)
The given regular expression can be represented by a DFA which has total ______ states, out of which ______ is/are final states.

Answer 1

Answer =4 FINAL STATES AND  TOTAL  = 7 STATES

Comments

can you please explain this

---

thank you

---

sir, can you please explain a bit more about this problem