3. (10 points) We have seen that ATM,ETM, EQTM, etc. are all undecidable problems. Give an example of a nonempty computational problem about Turing machines that is decidable. In other words, fll in the blanks below: M)M is a Turing machine and.. and prove that the resulting language is Turing-decidable