Q1) Prove that the following BNF grammar is ambiguous by showing a string in the language defined by this grammar that has two different parse trees. Assume that capital symbols are non-terminals and lower-case symbols are terminals and that S represents the start state. I S -> aaa S-> B A -> bB A -> a B -> A B -> b