Show that if M

is a DFA that recognizes language B

$,$ swapping the accept and nonaccept states in M

yields a new DFA recognizing the complement of B

$.$

Hint: You are showing the equality of two sets: the language recognized by the new DFA and the complement of B

$.$ You must show two inclusions. You must talk about the definition of $$accept$$ seen in class.