For any DFA D$,$ let D$$ denote the same DFA but where the accept states of D

are non$-$accept states in D$,$ and the non$-$accept states of D are accept states of D$.$ Observe

that for every input string w$,$ D accepts w iff D$$ rejects w$.$

In this problem you$$ll show that this idea fails badly for NFAs instead of DFAs. Specifically,

exhibit an NFA N $($with alphabet $\backslash$Sigma $=\{0,1\})$ with only two states, such that: there exists

a string that$$s accepted by both N and N $,$ and there exists a different string that$$s rejected

by both N and N $.$ Justify your answer