. State whether or not it is regular. . If you claim the language is not regular, prove your claim using the Pumping Lemma. . If you claim the language is regular, - Give a regular expression that matches exactly the strings in the language, - Give a graphical representation of an NFA that recognizes the language, - Convert the NFA into a DFA that recognizes the language, and - Minimize the DFA, that is, convert it into an equivalent DFA with as few states as possible and present it in graphical form. You do not need to construct the NFA using the method for translating a regular expression into an NFA discussed in class because this method tends to construct huge automata, which you do not want to manipulate manually. However, for the conversion from the NFA to an equivalent DFA and for minimizing the resulting DFA, you should use the methods discussed in class. (c) All strings over the alphabet (a, b, d, 1, r) that contain at least one of the words bad, bald, ball or bard