toc decidability

Question

Which of the following statements regarding $L_1$ and $L_2$ is true?
$L_1$ ={⟨M⟩ ∣ M has a state that is visited no more than 2017 times when started on an empty tape}

$L_2$ ={⟨M⟩ ∣ M has a state that is visited at least 2017 times when started on an empty tape}

• A. L1 is decidable and L2 is undecidable.
• B. L1 is undecidable and L2 is decidable
• C. Both L1 and L2 are decidable.
• D. Both L1 and L2 are undecidable

Comments

{⟨M⟩ ∣ M has a state that is visited at least 2017 times when started on an empty tape}.

Sir, Here "a state" means any one state ... right sir??  Actually, I thought it as " a particular given state". I think, I missunderstood the sentence.

And L1 should be undecidable  ... ?

---

@Arjun sir.....but L2 is a non trivial property of TM and according to Rice's Theorem it should be undecidable.....

---

@Arjun sir

For L1, as we have both left and right moves possible, then we can enter a state for more than 2017 times. Hence undecidable. But what about semi-decidablility.

For L2. Let L = {1, 11}, then we can say yes or no. So, this property is also undecidable.

Please comment about what is $T_{yes}$ and $T_{no}$ in above these and which out of these two is not even semi-decidable.