(a) Consider the context-free grammar ([S, P],sa,f,*, R, S) where R is this set of rules: S S*P P - aP Show that this grammar is ambiguous by exhibiting a string with two different derivation trees (b) Suppose we added a terminal g and replaced the 1st rule above with the rule Argue that the newg