Using the same alphabet $\backslash$Sigma $3$

$,$ but just seeing the rows as strings over $\{0,1,2\}$

$,$ show, using the pumping lemma, that the following language is not regular:

E$=\{$w in $\backslash$Sigma $3$the bottom row of w is the reverse of the top row of w$\}.$

You must use the format seen in class $($Let p$>0$

$,...).$