Define a context-free grammar that generates exactly each of the following languages. For consistency, please use S for the start variable in all three grammars 1. A = { x E {0. 1}* | the middle symbol in x is 0 and larl is odd}