$1.10$ points Use Rice$$s Theorem to prove

the following language is undecidable:

L $=\{$M$|$ M is a TM and $|$L$($M$)|=1\}$

To do this, demonstrate $|$L$($M$)|$ is a non$-$trivial property, and apply the

theorem.