3. (10 points) True or False (and justify a) For each Turing machine M, there is some Turing machine M1 with L(M) L(Mi) and such that M b) For each Turing machine M, there is some Turing machine M2 with L(M) L(M2) and such that M2 c) For each Turing machine M, there is some Turing machine Ms with L(M) L(Ms) and such that Ms never loops (i.e. its computations must accept or reject) never rejects (i.e. its computations must accept or loop) never accepts (i.e. its computations must reject or loop)