$(4$ points$)$ Let $M$ be the set of all Turing machines. Which statement is not true?

A Every Turing machine can be uniquely encoded into a finite binary string.

We can order the set $M$:$\{($:$M_1$:$),($:$M_2$:$),$dots$\}.$

$M$ is countable.

Given any language $L$ there is a Turing machine that recognizes $L.$

All of the above are true.