I will upvote for a correct answer. Please make sure the answer is correct.

The question I need answered is below:

A context-free grammar G=(V,T,S,P) is said to be a simple grammar or s-grammar if all its productions are of the form Aax, where AV,aT,xV, and any pair (A,a) occurs at most once in P. 2. (3 points) Find a s-grammar for the following language. L={anbn+1n1}