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