3. Question 3. Recall that we can specify the syntax of a language using BNE Consider the following grammar: | . . | . . ABCD 1234 (a) (1opt) Show the left-most derivation for the statement: A. 1. 2. 3. B. 1. 2. (b) (10pt) Show the left-most derivation for the statement: 1. A. B. C. 2. 1. 2. (c) (10pt) Show the syntax tree for the left most derivation of the statement: A. A. B. B. (d) (iopt) Notice that the grammar we consider is ambiguous. The string in item (c) has more than one syntax trees. Show another syntax tree of the left-most derivation for the above statement. (e) (10pt) Write a similar grammar that is not ambiguous. This will require you to add a restriction on the current grammar to eliminate the ambiguous statements