Description

YOUR NAME HERE
Prove that each of the following languages is context-free by finding a context-free grammar for it.
1. {aibj | i ≥ j ≥ 0}
2. {a4n+5b3n+2 : n ≥ 0}
3. {aibjck | i = j or j = k}
1