Give a proof that the following language over the alphabet = { a, b, c } is not a regular language.

L = { aⁿ b^k c^j | j > n OR j > k }