Consider the following ambiguous context free grammar for the language L = { a n b k | n aSbb S --> Prove that this

Consider the following ambiguous context free grammar for the language

L = { aⁿ b^k | n <= k <= 2n }

S --> aSb

S --> aSbb

S -->

Prove that this grammar is ambiguous by drawing two different parse trees for the string w = aaabbbbb.