Problem 3. (10 points) For each of the following statements either argue that it is true, or else give a counterexample. a Every finite language is regular. b) If every state of an NFA is an accept state then its language is " c a k-state DFA accepts a string of length k then its language is infinite. d) Regular languages are closed under union and intersection and the difference operator. If every state of an NFA for language L is flipped then the new NFA accepts the complement of L. If every state of an NFA is flipped then the language accepted is not necessarily regular. e) f)