For N $=($Q$,\backslash$Sigma $,\backslash$delta $,$q$0,$F$)$ an NFA, define NFA N as follows: N $=($Q$,\backslash$Sigma $,\backslash$delta $,$q$0,$Q$$F$).$

Consider the following statements.

$($a$)$ For every NFA N without $$ transitions, L$($N$)$ L$($N$).$

This statement is TRUE $/$ FALSE $($circle your answer$).$

If you answered $$TRUE$,$ informally and briefly explain your answer. If you

answered $$FALSE$,$ give a simple counterexample $($draw the state diagrams of N

and N and say what L$($N$)$ and L$($N$)$ are$).$

$($b$)$ For every NFA N without $$ transitions, L$($N$)$ L$($N$).$

This statement is TRUE $/$ FALSE $($circle your answer$).$

If you answered $$TRUE$,$ informally and briefly explain your answer. If you

answered $$FALSE$,$ give a simple counterexample $($draw the state diagrams of N

and N and say what L$($N$)$ and L$($N$)$ are$).$

$($c$)$ The class of languages accepted by NFAs without $$ transitions is closed under

complement.

This statement is TRUE $/$ FALSE $($circle your answer$).$

If you answered $$TRUE$,$ informally and briefly explain your answer. If you

answered $$FALSE$,$ give a simple counterexample.