READ ALL INSTRUCTIONS AND TEST CASES CAREFULLY:

Construct an NFA in $6$ or fewer states $(-50\%/$extra state$)$ that recognizes strings without $010$ as a substring or is just $01$ repeatedly; empty string should be accepted. For the test cases, first $4$ cases should ACCEPT, and the last $4$ cases should REJECT.

$01$

$01010101$

$011011100011$

$1110110110000$

$010$

$0101010$

$010101111010$

$1111110101$