Nondeterminism 5. Give an NFA with the specified number of states for recognizing each language below. In each case, I = {0, 1} (a) [7 pts) L1 = {w W contains an even number of Os or contains exactly two 1s} with six states. (b) [8 pts) L2 = {w | the second symbols from both ends of w are the same }. 6. (a) [5 pts) Show that if M is a DFA that recognizes language B, swapping the ac- cept and nonaccept states in M yields a new DFA recognizing the complement of B. Conclude that the class of regular languages is closed under complement. (b) [5 pts) Show by giving an example that if N is an NFA that recognizes language C, swapping the accept and nonaccept states in M doesn't necessarily yield a new NFA that recognizes the complement of C. (c) [5 pts) Is the class of languages recognized by NFAs closed under complement? Explain your answer. 7. (15 pts) Convert the NFA below into a DFA. Show only the reachable states in the DFA. 1 0,1 0,1 91 92 93 94