2. Let G = ({S,T,U}, {0,#}, R, S)

2. Let Gs((S,T,U},{0,#),R,S), where R-(S TT I u; T TO 1 OT I #; U OU00 | #). a. Describe the language L (in English) that is generated by the CFGG 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