For the following 2 languages, decide if they are (RE) recursiveenumerable (r.e.), (CO-RE) co-recursive enumerable (i.e. thecomplement is r.e.), (BOTH) both r.e. and co-r.e., or (NEITHER)neither r.e. nor co-r.e., and justify your answer. Note this meansshowing two things each: L is r.e. or not, and ~L is r.e. ornot.
a. L = {M#x : on input x, M never writes the symbol a on itstape}
b. L = {M#N#x : M halts on x but N loops on x}
Expert Answer
An answer will be send to you shortly. . . . .