Problem 3. [40 points) For each language, either prove the language is regular (by creating an implementation with your choice of a DFA, NFA, RegEx, Regular Grammar, or using closure properties), or prove that it is not regular (by either using the pumping lemma or closure properties). {xx" x |