Give a proof that the following language over the alphabet = { a, b } is not a regular language.

L = { uu | for some string u in * , | u | >= 1 }