Number of states in a DFA that accepts the language over the alphabet{0,1} where words start and end with a '1', have even length and where any 0 in the word is immediately followed by at least a 1.

Question

Examples of accepted words: 1011, 101101, 1111

Example of non-accepted words: 101, 1001, 010

The solution says the min-DFA contains 5 states but I could only do it in 4. Am I correct or where am I going wrong?
My solution:

Comments

“111” is accepted by the dfa but it should not as  it has odd length.

---

@Kabir5454 Can the transition on ‘1’ at q3 go to q2?

---

Maybe I see now where I was going wrong. Is this one correct?