For each of the following languages, state with justification whether it is decidable or undecidable. If it is possible to apply Rice's Theorem, your justification must invoke Rice's Theorem. If it is not possible, give a different valid justification. (a) LREC = {(M): M recognizes some language} (b) LFINITE-EVEN = {(M): |L(M) is finite and even} (c) LNESTING = {((M), (M2)) : L(M) CL(M2)} (d) LEECS = {(M): {(183), (203), (280), (281), (370), (376)} L(M)}