6. Consider the grammar Gl: S -e. S-aS, SaSbS and the language L that contains exactly those strings of a's and b's such that every prefix has at least as many a's as b's. We want to prove the claim: G1 generates all strings in L. We take the following inductive hypothesis to prove the claim: For n