Gyorgy E. ReveszExercise 1.1: Show the grammar $G$ generates the language $L$
Generally speaking, you need to do two things:


Prove that every word generated by $G$ is in $L$.
Prove that every word in $L$ can be generated by $G$.


Hints for (1): Prove by induction on the length of the derivation.

Hints for (2): Prove by induction on $i$.