Recall that we showed that the regular languages were closed under complement by showing that if M is a DFA and B=L(M), then swapping the accept and nonaccept states in M yields a new DFA M such that L(M)=B. Part 1 Show, by giving an example, that if N is an NFA and B=L(N), then swapping the accept and nonaccept states in N doesn't necessarily yield a new NFA that recognizes the complement of B. Part 2 Is the class of languages recognized by NFAs closed under complement? Explain your