Use the CFL pumping Lemma to show each of these languages not to be context-free.
{ww^R w | w is a string of 0s and 1s}. That is, the set of strings consisting of some string w followed by the same string in reverse, and then the string w again, such as 00100001.