I. Give NFAs with the specified number of states recognizing each of the following lan- guages. In all cases, the alphabet is -1o,1) (a) The language [w w ends with 00 with three states. The language (u E states. u, contains at least two 0s, or exactly two 1s) with six L w wE (0,1] and w ends with 00]. L is the language represented by the regular expression (a + b)'aa(a + b). Show by giving an example that, if M is an NFA that recognizes language C, swapping the accept and non-accept states in M doesn't necessarily yield a new NFA that recognizes C