Construct a DFA that recognizes strings without $010$ as a substring or is just $01$ repeatedly; empty string should be accepted.

There is a corresponding test file p$3$test.txt:

$01$

$01010101$

$011011100011$

$1110110110000$

$010$

$0101010$

$010101111010$

$1111110101$

First $4$ should accept, the second $4$ reject.