D is the language {M) M is a TM such that L(M)-(1)) We discussed this language in lectures 6 and 7. For each of the following languages, prove whether it is decidable, recog- nizable, co-recognizable, or neither. Do not use Rice's theorem. If you write a TM, briefly explain why it must work. (20 points each) L,-{ M) I M is a TM such that D = L(M)) D is the language {M) M is a TM such that L(M)-(1)) We discussed this language in lectures 6 and 7. For each of the following languages, prove whether it is decidable, recog- nizable, co-recognizable, or neither. Do not use Rice's theorem. If you write a TM, briefly explain why it must work. (20 points each) L,-{ M) I M is a TM such that D = L(M))