Turing Recognizable (TestBook Question)

Question

Which of the following is/are NOT turing-recognizable?

1. L₁={M₁M₂|M₁M₂ are Turing Machines with L(M1)=L(M₂)}

2. L2={M,w|M is a Turing Machine that halts on input w}

3. L₃={M,w|M is a Turing Machine that accepts string w}

4.All of the Above

Comments

i)Equivalence property of REL's are undecidable.so it is non REL

ii)halting problem also undecidable,we cannot guarantee a particular string hlats on TM so it is non REL.

iii)membership property also undecidable,so it is non REL.

i think all are not REL's.

---

1. will be RE BUT NOT REC 

2.halting problem is also RE BUT NOT REC 

3.membership problem of tm is also RE BUT NOT REC. 

4) option should be ans .

@Arjun sir ?? 

---

Option given in the solution was A. Options B and C were given Turing recognizable languages.