For each of the following 5 questions, state TRUE or FALSE. If TRUE, give a short proof. If FALSE, give a simple counterexample. (a) The following language L is decidable: L-M) M is a TM and, for all inputs w, M accepts w within 10000 steps ) (d) If L is not a CFL, and L' = L \ S, for some finite set S, then L' is not a CFL. For each of the following 5 questions, state TRUE or FALSE. If TRUE, give a short proof. If FALSE, give a simple counterexample. (a) The following language L is decidable: L-M) M is a TM and, for all inputs w, M accepts w within 10000 steps ) (d) If L is not a CFL, and L' = L \ S, for some finite set S, then L' is not a CFL