Undecidable

Consider the following languages:

HALT$=\backslash$left$\backslash \{\backslash$left$|\backslash$text$\{$Turing Machine M stops $($either accept or reject$)$ on input w$\}\backslash$right$|\backslash$right$\backslash \}$

and

Stops$\_\{\backslash$forall$\}=\backslash$left$\backslash \{|$M$\backslash \backslash$text$\{$is a Turing Machine that always stops on any input$\}\backslash$right$\backslash \}$

$1)$Show that Stops$\_\{\backslash$forall$\}$

is Turing$-$recognizable

$2)$Show that

is undecidable by using a reduction from HALT

Show that Stops$\_\{\backslash$forall$\}$

is undecidable by using a reduction from HALT

i need direct answer