This question will be on the midterm exam:

Let L be the language consisting of all strings over the binary alphabet
{0,1} of the form xx, where x is a string.

Use the pumping lemma for context-free languages to prove that L is not
context-free.