1. Give context-free grammars that generate the following languages. In all parts the alphabet s {0, 1}. a) {w | wcontains at least two Os) b) w the length of w is even) c) w w starts and ends with the same symbol) d) w the length of w is odd and its middle symbol is a 0) e) w wwR, that is, w is a palindrome) f) The empty set g) The empty string 2. Give pushdown automata for the languages in question 1