Considering the Rice$$s theorem described in Problem $5\mathrm{.}16($page $240)[$ Introduction to the Theory of Computation, $3$rd ed$.]$ and its answer, use the Rice$$s theorem to prove that the following languages are undecidable:

$($a$)$ EMPTYTM $=\{$M$$ : M is a TM and L$($M$)=\}.$

$($b$)$ ALLTM $=\{$M$$ : M is a TM and L$($M$)=\backslash$Sigma $\}.$

$($c$)$ ACC$100$TM $=\{$M$$ : M is a TM with $\backslash$Sigma $=\{0,1\}$ and $100$ in L$($M$)\}$