5. Decide whether the following languages are decidable or undecidable. If Rice's theorem is applicable, you must use Rice's theorem to show a language is undecidable. Otherwise, justify your answer appropriately. (a) L376-1(M) I L(M) contains exactly 376 elements) (b) L281 = {(M), x) | M running on x takes exactly 281 steps) (c) L370-KM) I L(M)-(370)) (d) L = {M) 11L(M)120} (e) Le-Halt = {M) | M halts on input }