Show using the pumping lemma that L = { $w$$w^{R}$$w$ | $w\in$ {a,b}* $w\notin$ context-free language where $w^{R}$ denotes the reversed word $w$.
(if $w$ = $w_{1}$$w_{2}$$w_{3}$ ... $w_{n}$ ,$w^{R}$ = $w_{n}$$w_{n-1}$...$w_{2}$$w_{1}$
Use pumping lemma to prove that L is not a context-free language.
If the pump principle is used, how should it be constructed? I don’t know exactly how to solve it.