Class of regular languages is closed under complement by showing that if is a DFA that recognizes a regular language , then swapping the accepting and non-accepting states yields a DFA that recognizes the complement of A. Show, by giving a counterexample, that this construction may not work if is an NFA instead of a DFA. That is, show that if is an NFA that recognizes a regular language , then swapping the accepting and non-accepting states may not result in an NFA that recognizes the complement of . Justify your answer.

Hint: give a specific NFA = (, , , 0 , ) for which the constructed NFA = (, , , 0 , ) does not recognize the complement of the language of .