10. Write a context-free grammar generating the set of all strings corresponding to lists of pizza orders. A pizza order has a size (s, m, or 1) followed by a crust (t or h) followed by up to 5 optional toppings chosen from a, m, o, p, or s. Double toppings are not allowed. m will not precede a, o will not precede m or a, etc. Commas are used to separate items in a list. A list may be empty. (12 points) 11. The language described in the previous question is a regular language, so it is possible to build a DFA accepting the language. How many transitions must each state in the DFA have and why? (3 points)