Let L be a recursively enumerable language and L is not empty. Is there a subset of L that is recursive? Prove or disprove it. Let H(M) be the set of inputs w such that M halts given input w. The halting problem is the set of pairs (M, w) such that w is in H(M). Prove that the halting problem (the set of pairs) is recursively enumerable, but not recursive. Is it possible to write a C compiler that will tell whether a C program will always terminate on any input? Justify you answer. Let L be a recursively enumerable language and L is not empty. Is there a subset of L that is recursive? Prove or disprove it. Let H(M) be the set of inputs w such that M halts given input w. The halting problem is the set of pairs (M, w) such that w is in H(M). Prove that the halting problem (the set of pairs) is recursively enumerable, but not recursive. Is it possible to write a C compiler that will tell whether a C program will always terminate on any input? Justify you