a) Given a Turing machine M with an input string w, describe a TM M₁ with the property that M accepts w if & only if M₁ accepts 0. (To describe M_1, consider an arbitrary input string x & say how M₁ operates on x. Thus, description of M₁ should begin with: "M₁ on input x: .... ". b) What does part (a) imply about the language L = { 1 > | M₁ is a TM that accepts 0}.