For each of the following languages, state with justification whether it is recognizable or unrecognizable. (a) LHALT>376 = {((M), 1): machine M halts on input 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),31,...,In): M accepts I; for some 1