$(30$pt$)$ Consider set expressions containing sets, $\{a,b,$dots,$z,\frac{O}{,}U\}(U$ contains all the other set operators, $,,$not, and parentheses; not has higher precedence than $,$ which has higher preceden than $$; all operators are assumed left associative.

$($a$)(5$pt$)$ Write an $SLR(1)$ grammar, $G,$ which is not $LL(1),$ for such expressions, which obeys t precedences indicated.

$($b$)(3$pt$)$ Compute the FIRST$(Y^x)$ and FOLLOW$(x)$ sets for all nonterminals $x$ and PREDICT$(i)$ se for all productions i$.($jflap does not give PREDICT$()$ sets; you need to build those$)$

$($c$)(2$pt$)$ Prove that $G$ is not $LL(1)$; give the total number of conflicts.