Recall that with a DFA, we can recognize the complement of the language of the DFA by toggling the accepting and rejecting states. This question considers whether we achieve the same result if we toggle the accepting and rejecting states of an NFA Consider the following statements (a) For every NFA. M, L(N) -L() 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, L(N)2 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)