Consider following languages

L₁ = { | T is a Turing machine and T halts on w},

L₂ = { | T is a Turing Machine and T does not halt on w}

L₃ = { | T is a Turing Machine and T and T accepts w^R whenever it accepts w}
Which of the following statement is true?

L₁ and L₂both are REL.

L₃ is decidable.

L₃ is undecidable.

L₁ is REL and L₂is not REL.

Consider following languages L1 = { | T is a Turing machine and T halts on w}, L2 = { | T is a Turing Machine and T does not halt on w} L3 = { | T is a Turing Machine and T and T accepts wR whenever it accepts w} Which of the following statement is true?