Use the pumping lemma to prove these languages are not regular. (5 points) a. {0^n 1 0^n | n ≥ 1}
a. Regular
b. Not Regular
c. Context-Free
d. Deterministic Context-Free