What level of the Chomsky hierarchy do each of these languages fall into, and why? Hint: Consider the
Pumping Lemma - Regular, Context Free Grammars, or General Grammars when solving these problems.
(a) L1 = {anbn|0 ≤ n ≤ 1000}
(b) L2 = {anbn|n ≥ 0}
(c) L3 = {anbm|n, m ≥ 0}