READ ALL INSTRUCTIONS AND TEST CASES CAREFULLY:

Construct an $\backslash$epsi $-$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$).$

$$ This is easy, actually, but I$$m going to constrain you to having no more than $12$ transitions$/$edges $(-50\%/$additional edge$),$ not states.

$$ Your answer should have lambda transitions and used productively.

$$ First ~$100$ should accept, the last $10$ reject.

$$ Empty string should accept

Here are the last $10$ because I cannot post over $100.$ LAST $10$ SHOULD REJECT

$1101011$

$0111110$

$1100011$

$011111$

$01101111$

$110011010110111101011$

$0110111101101100110111110$

$01110011010110111001011101100011$

$01110011010110111001011101101011$

$11010110111001101011011100101110$