$(12)$ Let Lsube$\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 $/$bar $($L$).$ So we build an NFA M$^(\text{'})=($Q$,\backslash$Sigma $,\backslash$delta $,$q$\_(0),($Q$)/(/)$F$).$ This does not seem to work in general. To show this, $($a$)$ Give an example of an NFA M for which L$($M$)$su$($b$)/($b$)$ar $($L$($M$^(\text{'}))).($b$)$ Give an example of an NFA M for which L$($M$)()/($b$)=$ar $($L$($M$^(\text{'}))).($c$)$ Give an example of an NFA M for which L$($M$)$su$($p$)/($b$)$ar $($L$($M$^(\text{'}))).$