Regular - CFG

Question

Consider the language L₁ = { a^pb^qc^r / p,q,r >= 0} and L₂ = { a^pb^qc^r ​/ p,q,r >= 0 and p=r}  

Then L₁ - L₂ is regular of CFL ?

Answer 1

$L_1 = \{a^pb^qc^r \;|\;p,q,r\geq 0 \}$

$L_2 = \{a^pb^qc^r \;|\; p,q,r \geq 0, p=r\}$

$L_1 - L_2 = $ strings in $L_1$ those are not in $L_2$

$ =\{a^pb^qc^r \;|\; p,q,r \geq 0, p \neq r\}$ , will be $CFL$