Let G = ({S,A,B,C,D,E,Z},(0,1),R,S), where R = {S → E | Z; E → A | C; A → 01B | 0A | ; B → 1B | 10A; C →10D |1C |; D →01C |0D; Z →0Z1 |}. (a) Describe the language L (in English) that is generated...

Let G = ({S,A,B,C,D,E,Z},(0,1),R,S),
where R = {S → E | Z; E → A | C; A → 01B | 0A | ; B → 1B |
10A; C →10D |1C |; D →01C |0D; Z →0Z1 |}.
(a) Describe the language L (in English) that is generated by the CFG
G.
(b) Prove that the language L generated by the CFG G is not regular.
Hint: use the fact that regular languages are closed under union
and prove that one component of the language is not regular by
the Pumping Lemma.