For each of the languages below, draw the state diagram for a nondeterministic

finite automaton $($NFA$)$ to accept the language. your NFA must have at most the number of states specified

your NFA must take advantage of nondeterminism

There must be at least one case where the machine has a choice between two or more

next states on some input symbol, or at least one case where the machine has no possible

next state on a particular input symbol, or you must use $lon-$transitions $($in a non$-$trivial

way$).$

$($b$)L_2=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{0,& 1{\}}^{**}|\end{array}$ the last two symbols of $w$ are the same as each other, ffdffff NFA must have at most the number of states specified

your NFA must take advantage of nondeterminism

There must be at least one case where the machine has a choice between two or more

next states on some input symbol, or at least one case where the machine has no possible

next state on a particular input symbol, or you must use $lon-$transitions $($in a non$-$trivial

way$).$

$($b$)L_2=\{\begin{array}{ccc}\text{w}\text{i}\text{n}& \{0,& 1{\}}^{**}|\end{array}$ the last two symbols of $w$ are the same as each other, ffdffff