Note Diagrams and execution traces may be scanned, but everything else must be typed

(d) Consider the following grammar for generating function prototypes in a Java-like language. The alphabet for this language contains the following terminals (words and symbols): E={public, private, static void, int, float, double, main, compute, x, y, z, (,), .,;}. Start: AccMod = Type = FunName = ArgName = ArgList= Arg : AccMod Type FunName(ArgList); public AccMod private AccMod AccMod static | E void | int float | double main compute x y z Arg | ArgList, Arg Type ArgName Show that this grammar is ambiguous by drawing two derivation trees for the fol- lowing prototype: public static double compute(float y, double z); Note: All of the variables (non-terminals) are shown in bold in the above grammar. [5 marks]