Problem 1 Find a grammar for the language L = {a n+1b n : n 0}. Prove that the language defined by your grammar is equivalent to L. There might be many ways to describe L, but think about how to do it in a modular way.

Problem 1 Find a grammar for the language L = {an+Ibn:n>0}. Prove that the language defined by your grammar is equivalent to L. There might be many ways to describe L, but think about how to do it in a modular way