Dynamic Programming 16

0. Language L₁ is polynomial time reducible to language L₂ Language L₃ is polynomial time reducible to L₂, which in turn is polynomial time reducible to language L₄. Which of the following is/are True?
I. If L₄ ∈ P, L₂ ∈ P
II. If L₁ ∈ P or L₃ ∈ P, then L₂ ∈ P
III.L₁ ∈ P or if and only if L₃ ∈ P
IV. If L₄ ∈ P then L₁ ∈ P, then L₃ ∈ P

Answer
Comment
Array

Option : C
Explanation :
L₂ ≤ pL₄
L₁ ≤ pL₂
If L₄ ∈ P
then L₂ ∈ P
L₁ ∈ P,

Forgot your password?

I agree with the Terms.