Let ∑ = {a, b}. Write a Context-Free Grammar for the language consisting of strings that have n copies of the letter a followed by n+1 copies of the letter b, where n > 0. i. e. L = {a n b n+1 , n > 0}

CFG is unambiguous because it is not generating more than one derivation tree for given input string, it is said to be ambiguous when there is more than one derivation tree are there for given input string. See attached picture.

Explanation:

See attached picture.

i'm so sorry that's not a question and this isn't an answer