Q2 - Chapter 3 Problem Set 8 modified (7 points) Prove that the following grammar is ambiguous: + | + | abc Hint: If you can find a sentence[input string] (for example a, a + b, c+b+a, c+b+b+c, etc... are all languages) with more than one parse trees with the given grammar, then this grammar is ambiguous