Recall the language F defined by: F (M) C(M) is finite ). Show that ATM Sm F. (Hint: given (M,w), we construct a machine M' so that, on input x, M' should run M on input w accepts in that many steps? What if M does not accept in that many steps?) for lax| steps. What should M' then do if M 2. Sketch a proof that P is closed under intersection and complement