4. For each of the following languages, state whether it is decidable or not. If so, clearly describe a TM that decides it; if not, prove that it is undecidable (a) Let S be any fixed finite set of strings (M), r) | M(r) terminates in 376 steps (c) L