The language of Turing Machine that halts on all inputs is:

$*$

$1$ None of the mentioned

$2$ Recursively enumerable

$3$ Non$-$recursively enumerable

$4$ Recursive