let G be the context-free grammar: Write #(X) = the number of symbols in the string x, and L(G) = the language L = { w E {a,b)* : #a(w) = #6(w) ). Prove the following Lemma E L, it can be written where #a(y) #6(y) and #a(z) = #6(z)