Consider the following grammar G:

S $->$ E $+$ E $|$ E $$ E $|($E$)$

S $->1|2|3|4$

$($a$)$ Give a description of L$($G$)$ using set notation.

$($b$)$ Show that G is ambiguous.

$($c$)$ Give an equivalent CFG that is not ambiguous. It suffices to give the rules. Your

CFG should not be overly complicated.