Problem $1\mathrm{.}2.$ Consider the alphabet $A=\{a,b,d,c,e\}$ and let $L$ be the set of all

phrases $inPhra(A)$ with the following properties:

length $()$ is an odd number.

$$ is palindrome. That is$,$ if $n=$ length $(),$ then $(i)=(n-i)$ for each

accdbdcca$(\frac{n-1}{2})=e(0)=c=(n-1)EG($:$E$:${)}_G=Li.$ For example: accdbdcca.

$If(\frac{n-1}{2})=e,$ then $(0)=c=(n-1).$

Provide a set $Eof$ only one symbol and a formal grammar $G$ with $at$ most six

grammar rules for which $($:$E$:${)}_G=L.$