2. (7 points) Recall that ATM-(M,w) Mis a Turing machine, w is a string, and wE L(M)) In class, we defined the Turing machine RATM as "On input M,w) where M is a Turing machine and w is a string over the input alphabet of M: . Run M on w. 2. If M accepts, accept; if M rejects, rejects." For this question, fix = {0, 1). Answer True or False. 1:1,R 40 (b) e)E ATM (c) , R 1:1.R 0:0.R ATAM ATAM