Find a grammar that recognizes the following language:

$\{$a$^$ib$^$jc$^$k $|$ i $=$ j or j $=$ k$,$ where i$,$ j$,$ k $>=0\}$

Find a grammar that recognizes the following language:

$\{$w$|$ w starts and ends with the same symbol$\}$ over $\{$a$,$ b$\}$

Find a grammar that recognizes the following language:

over the alphabet $\{$a$,$b$\},$ words that can be written w z w$^$R with w nonempty and z any word. That is$,$ these are words that start with a nonempty word and end with its reverse.