Consider the following languages:

L₁ = pⁿ q^5m r¹⁰ⁿ | n ≥ 1 and m ≥ 1

L₂ = p^2m q^a r²ⁿ s^b | m = n and a = 2b where m, n, a, b ≥ 0

L₃ = p^a q^b r^c  s^x | a = b = c where a, b, c, x ≥ 0

Which of the following is/are incorrect?

I. L₁ can be accepted by deterministic pushdown automaton.

II. L₂ can be accepted by the non-deterministic pushdown automaton

III. L₃ is a context-free language