Consider the following NFA M , over the alphabet {a}
let L(M) be the language accepted by the NFA M . let $M'$ denote the machine obtained by the final and non final states respect . then which of the following statement is true about L(M) and $L (M' )$
1 ) $L (M' ) \supseteq L(M))$
2) $L (M' ) \cap L(M)) = phi$
- $L (M' ) - L(M)) = phi$
- $L (M' ) \cup L(M)) = phi$