For each of the following two languages, determine and showwhether it is recursive, recursively enumerable, or neither. Cannotuse Rice’s theorem.
(a) L3 = { <M> | M is a TM, a ∈ L(M) }
(b) L4 = { <M> | M is a TM, L(M) = {a} }
Expert Answer
An answer will be send to you shortly. . . . .