8. Consider the language containing those strings consisting of two or more a characters followed by a single x character. {aax, aaax, aaaax, aaaaax, ...} a. Write a regular expression that generates this language. b. Draw the diagram of a DFA that recognizes this language. C. Write a BNF grammar (not EBNF!) that generates this language. d. Is your grammar from the previous step ambiguous? Justify your