Question 3 One of the following questions is decidable and the other is undecidable. For the undecidable question prove undecidability and for the decidable one give an algorithm. Your algorithm can...

Extracted text: Question 3 One of the following questions is decidable and the other is undecidable. For the undecidable question prove undecidability and for the decidable one give an algorithm. Your algorithm can use known algorithms as basic steps. You should not describe well-known graph algorithms or algorithms covered in class in detail. Here L is a context-free language with a given grammar and R is a regular language with a given DFA; both are over the same alphabet Σ 1. LNR= 0 2. LUR= E*