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 Rices Theorem, your justification must invoke Rices Theorem. If it is not possible, give a different validjustification.

(a)L={M:L(M) =}

(b)L-HALT={M:Mhalts on}

(c)L376q={M:Mis a Turing machine with at least 376 states and ={0,1,}

}(d)Lfinite={M:L(M) is finite}

(e)L={M:|L(M)|0}