\item When applying eager encoding to decide the satisfiability of a formula in $\EUF$, explain how reflexivity, symmetry and transitivity are handled within the graph-based reduction.
