Consider the following languages : L1 = { an bm cn + m

Consider the following languages :
L₁ = { aⁿ b^m c^{n + m} : m , n > 1 }
L₂ = { aⁿ bⁿ c²ⁿ : n > 1 }
Which one of the following is TRUE ?

1. Both L₁ and L₂ are context-free.
2. L₁ is context-free while L₂ is not context-free.
3. L₂ is context-free while L₁ is not context-free.
4. Neither L₁ nor L₂ is context-free.

L₂ is not context free. No. of b 's will match with no. of a 's leaving c 's to be matched with no one. So L₂ cannot be context free.