1. Let SUBSETTM = {<M1,M2> : M1 and M2 are Turing machines and L(M1) L(M2)}. Is

SUBSETTM decidable? Prove your answer is correct.

2. Let L = {<M> : M is a Turing machine that accepts at least 2 different strings}. Is L recognizable?

Prove your answer is correct.