Question 5: Answer the following: a) State Rice's Theorem b) Is the language {? M? | M is a Turing machine with less than 100 states ) undecidable? Justify your answer. c) Can we apply Rice's Theorem to the language M) M stops on the input 101!? Justify vour