Consider the following grammar:

$L-L$;$S|S$

$S-A|C$

$A-id=E$

$Cid(E)$

$E--id|$ num

a$)(5$ marks$)$ Rewrite the above grammar to be LL$(1)$

c$)(5$ marks$)$ Compute first and follow sets for non$-$terminals of the resulting grammar