1. Consider machine M = (Q, ?, ?, ?, qi, qaccept, qreject), where 0-(qi, q2. qaccept, qreject},-{0,1), ?-(0,1 U}, and transition function follows: is as ? (q2, 0)-(qi, U, R) 6 (q2, 1)- (q1, U, R) Prove that M is NOT a decider. Describe in mathematical terms the language L that M recognises, and verify your answer, ie prove that L L(M) iii.Is L Turing-decidable