Consider the following languages-
L1={<M>| there exists x,y belonging to (sigma*) such that either x belongs to L(M) or y does not belong to L(M)}.
Answer- Recursive, This is the language of all turing machines
L2={<M1,M2>| L(M1) < L(M2)}
Answer- Not even recursively enumerable.
Arjun sir plzz explain these languages.