Problem $6$

Let $=\{0,1\},$ Let $L=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{0,& 1{\}}^{**}\text{:}{n}_0(w)=n_1(w)=2\end{array}$

$\}$

a$)$ Create a simple NFA M that accepts the language L$.$ Create

and test your NFA on JFLAP. Copy the JFLAP NFA

diagram into Homework #$3.$

b$)$ Test your DFA diagram with all strings in L plus the

following strings:

$01,11,0011,1010,1001,1100,1000,010110,1110$

Copy the JFLAP test diagram for your NFA to Homework

#$2$