Write a non-ambiguous CFG generating the words of the form $xcy$, where $x,y$ are words over $\{a,b\}$ such that $y^R$ is suffix of $x$, i.e., such that $x$ can be written of the form $zy^R$ for some word $z$.