4. Decidable or not? Turing acceptable or not? Yes/no with one sentence explanation.

a. Given a Turing machine, does it ;have at least 100 states?

b. Given a Turing machine with 101 states, does it enter q-100 on some input string?

c. Given a CS 1160 program to write Hello World, does the program compile without errors?

d. Given a CS 1160 program to write Hello World, does the program run correctly and print Hello World?

e. Given a Turing machine, does it accept the empty string?

f. Given a Turing machine, does it accept at most 5 strings?