For problems 36-40, prove that the indicated languages are not regular without using the pumping lemma. (Proofs using the pumping lemma will receive credit if they are completely correct; they will not be eligible for partial credit.)

Problem 40. {xx | x E {0, 1}*}