Language \(L_1\) is polynomial time reducible to language \(L_2\) . Language…

Language $L_1$ is polynomial time reducible to language $L_2$ . Language $L_3$ is polynomial time reducible to $L_2$, which in turn is polynomial time reducible to language $L_4$ . Which of the following is/are true?

I. if  $L_4 ∈ P$, then $L_2 ∈ P$

II. if $L_1 ∈ P$ or $L_3 ∈ P$ , then $L_2 ∈ P$

III. $L_1 ∈ P$, if and only if $L_3 ∈ P$

IV. if $L_4 ∈ P$ , then $L_1 ∈ P$ and $L_3 ∈ P$