Consider the following languages
L1 = {< M, q > |M is a turing machine that visits state q on some input within 10 steps}
L2 = {< M > |M is a turing machine, |M | < 100 where |M | is number of states in machine}
Which of the following is correct?
(A) L1 is decidable but L2 is not decidable (B) L2 is decidable but L1 is not decidable
(C) Both L1 and L2 is decidable
(D) Neither L1 nor L2 is decidable
In L2, if the states are unreachable, then will it be possible to detect whether machine has less than 100 states ???