Problem 9: For each of the following parts, define a grammar (using either BNF or EBNF) for the words, over the alphabet containing just and 1 , that are described. (a) All words ending with a 1 . (b) All words of length exactly 8 . (c) Al1 words (of any length) that contain the string 0101 . (d) A1l words with odd length. Show how to parse the word 00100 using your grammar. Problem 10: Show that the grammar.