Solution

The correct answer is option 1.

Key Points

• The problem "Is L1 ∧ L2 = ϕ?" is undecidable for context-sensitive languages L1 and L2. Here L₁∧ L₂ is a disjoint operator it's undecidable problem.

Hence statement I is correct.

• The problem "Is WϵL?" is decidable for context-sensitive language L, (where W is a string). Here W is a string that is accepted by the particular language is a membership problem and its decidable problem.

Hence statement II is correct.

Additional Information

Context-sensitive language is accepted by linear bounded automata and only membership(WϵL) problems are decidable.

Context-free language is accepted by pushdown automata and only membership problems(WϵL), finiteness L=finite, emptiness L=Φ are decidable.