READ ALL INSTRUCTIONS AND TEST CASES CAREFULLY:

Construct an NFA recognizing the concatenation of any number of $01,110,$ and$/$or $011,$ zero or more copies of each in any order $($the copies may be interleaved, look at the tests$).$You are constrained to having no more than in $8$ states $(-50\%/$extra state$).$ Empty string should accept. First ~$100$ should ACCEPT, the last $10$ should REJECT.

Here are the last $10$ since I can't print them all.

$1101011$

$0111110$

$1100011$

$011111$

$01101111$

$110011010110111101011$

$0110111101101100110111110$

$01110011010110111001011101100011$

$01110011010110111001011101101011$

$11010110111001101011011100101110$