Prove that the following are not regular languages

f$)$ The set of strings of $0\text{'}$s and $1\text{'}$s that are of the form $w{w}^R,$ that is$,$ some

string followed by its reverse. $($See Section $4\mathrm{.}2\mathrm{.}2$ for a formal definition of

the reversal of a string.$)$