6) This is a CS 4110 question. Do question 6 using theorem 13.

6. Define the language SQUARE as follows: SQUAREa" where n is a square] This language could also be written as [a"'1. (i) Use the pumping lemma to prove that SQUARE is nonregular