let = {a, b}. Write a Context-Free Grammar for a 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}

Draw parse trees for the sentences aabbband aaaabbbbb, as derived from the grammar made

Prove or disprove whether your Context-Free Grammar is ambiguous.