et L $\backslash$Sigma $?$ be a regular language. Then there is an NFA M $=($Q$,\backslash$Sigma $,\backslash$delta $,$ q$0,$ F $)$ that

recognizes the language L$.$ But we want an NFA for the language L$.$ So we build an

NFA M $=($Q$,\backslash$Sigma $,\backslash$delta $,$ q$0,$ Q $\backslash$ F $).$ This does not seem to work in general. To show this,

$($a$)$ Give an example of an NFA M for which L$($M $)$ L$($M$\text{'}).$

$($b$)$ Give an example of an NFA M for which L$($M $)=$ L$($M$\text{'}).$

$($c$)$ Give an example of an NFA M for which L$($M $)$ L$($M$\text{'}).$