Draw a DFA (Deterministic Finite Automation) that has a its thrid to last digit as a 1

Question

Examples that work: 100, 0000000101,110101010101

 

This DFA requires at least 8 states

Answer 1

Regular expression: (0+1)*1(0+1)(0+1)

NFA:

construct the state transition table of the above NFA.