Problem 2. Draw NFAs for the following languages over binary alphabet
\Sigma ={0,1}
. xcontains even number of
1s
, odd number of
0s
, no substring 01
