for $L_1$ we can see that $p, q, r$ are independent of each other $\therefore$ the language is Regular.
for $L_2$ we can see that only one comparison is there which is between $p$ and $r$. variable $q$ is independent of the two. Hence it can be seen that it is DCFL.
$A$ : saying $L_2$ is CFL is True.
$B$ : intersection of a CFL with Regular is closed $\therefore$ this option is True.
$C$ : the complement of any CFL is Recursive, since recursive languages are closed under complement and all CFLs are R. $\therefore$ this option is True
$D$ : Regular languages are closed under complement Hence, this option is FALSE.
answer = option D