4. For each of the following languages, state with brief justification (no more than two sentences) whether it is decidable or undecidable. If it is possible to use an application of Rice's Theorem, your justification must invoke Rice's Theorem. If it is not possible, give a different valid justification. (a) L M) L(M) ) (b) LE-HALT = {(A1): M halts on } (c) L376-,-1(M) : M is a Turing machine with at least 376 states and= {0, 1,1)) (d) Lfnte KM) L(M) is finite) (e) L (M) IL(M)20