For each of the following languages, decide whether Rices theorem applies, and explain why it does or does not. a. {p | p is a recognition method and L(p) contains the empty string} b. {p | p is a recognition method and L(p) *} c. {m | m encodes a Turing machine M with abba L(M)} d. {p | p is a recognition method that contains the statement x=1;} e. {p | p is a recognition method that, when run on the empty string, executes the statement x=1;} f. {m | m encodes a Turing machine M for which L(M) is fi nite}