1. {w|w contains neither the substrings ab nor ba} - This language is the complement of a simpler language. Construct a DFA for the simpler language and then modify it to accept the language given.

2. Show by giving an (any) example that if M is an NFA that recognizes language L, swapping the accept and nonaccept states in M does not necessarily yield a new NFA that recognizes the language L which is the complement language of L. Is the class of languages recognized by NFAs closed under complement? Explain your answer