5. Consider the following CFG. Prove using induction for allstrings in this language, every prefix of the string has at leastas many as as it has bs.
Terminals: {a,b}
Starting: S
S→aS|aSbS|ε
Expert Answer
An answer will be send to you shortly. . . . .