Use the pumping lemma to prove that the following languages are not regular:

(a) . (The alphabet for this language is { 0, 1, , = }. For example, 1010 = 10 101 is in , but 1010 = 10 1 is not.)

(b) Let . Consider each row to be a binary number and let .