prove that the indicated languages are not regular without using the pumping lemma.

Problem 37. {010" (n = k +m}