Try to Decide $($Or Not$)$

Show that each of the following languages is undecidable. You may use any undecidable langugae we've shown in lecture for a reduction $($common choices are $A_{TM}$ and HALT, they both take $($:$M,w$:$)$ as input$).$

$($a$)AL{L}_{TM}=\{\begin{array}{c}(\text{:}M\text{:})\text{:}M\end{array}$ is a TM that accepts $\{$:${}^{**}\}$