Question $9$

$5$ pts

If every string in a language $L$ is accepted by a TM $($and no other strings ate accepted by that TM$),$ which is the correct description of $L?$

$L$ is decidable.

None of the other answers are correct.

$L$ is corecognizable.

L is recognizable.