Consider the following languages:

L₁ = a^p | where p is a multiple of 5

L₂ = aⁿ b³ⁿ c^m | n ≥ 1 and m ≥ 1

L₃ = a^m b^p cⁿ d^q | m = p and n = q where m, n, p, q ≥ 0

L₄ = a^m b^p cⁿ d^q | m = n or p = q where m, n, p, q ≥ 0

Which of the following are correct?

I. L₁ is a context free language

II. L₂ can be accepted by deterministic pushdown automaton

III. L₃ is a context free language

IV. L₄ is a deterministic context free language