L1 is the emptiness problem of TM which is undecidable

L2 is halting problem and we know that halting problems are undecidable

NOTE: Emptiness problem is decidable only for Regular languages, CFL and DCFL

but for CSL, REC and RE, it is undecidable.

39 Points

9 Points

6 Points

5 Points

4 Points

3 Points