Let L subset of or equal to sigma* be a regular language. Then there is an NFA M = (Q, sigma, delta, q_0, F) that recognizes the language L. But we want an NFA for the language L -. Following an idea from the class, we build an NFA M' = (Q, sigma, delta, q_0, Q/F). This does not work in general, I suspect. To show this, Give an example of an NFA M for which L(M) subset of L(M') - Give an example of an NFA M for which L(M) = L(M') - Give an example of an NFA M for which L(M) superset of L(M')