1. For each of the following languages, state with justification whether it is recognizable or unrecognizable. (a) LHALT>376 = {((M),x): machine M halts on input x after 376 or more steps} (b) LLIKES-SOME-EVEN = {(M):M accepts some even number} (c) LHATES-EVERY-EVEN = {(M): M does not accept any even numbers Hint: Find a way to apply Rice's Theorem. (d) L = {({M), X1, ..., Xn): M accepts x; for some 1 si sn}, for some fixed n. 1. For each of the following languages, state with justification whether it is recognizable or unrecognizable. (a) LHALT>376 = {((M),x): machine M halts on input x after 376 or more steps} (b) LLIKES-SOME-EVEN = {(M):M accepts some even number} (c) LHATES-EVERY-EVEN = {(M): M does not accept any even numbers Hint: Find a way to apply Rice's Theorem. (d) L = {({M), X1, ..., Xn): M accepts x; for some 1 si sn}, for some fixed n