Consider the language $\{w$#$w^R|win\{a,b{\}}^{**}\}$ generated by: $T$aTa$|bTb|$#$.$ Convert this to

Chomsky's Normal form $($CNF$).$

Let $A=\{\begin{array}{cc}w|win\{a,& b{\}}^{**}\end{array}$ and $\{$:$w=w^R\}.$ Construct context free grammar $($CFG$)$ in Chomsky's

Normal form.

Convert the following grammar into Greibach Normal form $($GNF$)$:

$SxB|AA$

$Aa|SA$

$Bb$

$xa$

Please show step by step.