In C$++$ Programming, I am attempting to implement the following grammar:

Basic Grammar

$(1)$ E$->$E$+$T$$

$(2)$ E$->$T$$

$(3)$ T$->$T$*$F$$

$(4)$ T$->$F$$

$(5)$ F$->($E$)$

$(6)$ F$->$id

Into the following algorithms:

Please implement the following algorithms

$($i$)$ Closure$($I$)$

$($ii$)$ Follow$($S$)$

$($iii$)$ Goto$($State$,$X$)$

$($iv$)$ CanonicalSet$($I$)$

$($v$)$ SLR$\_$parse$\_$tables$($grammar$)$