Let G $=($V$,\backslash$Sigma $,$ P$,$ S$)$ be a type$-2$ grammar with alphabet $\backslash$Sigma $=\{$a$,$ b$,$ c$\},$ variables V $=$

$\{$S$,$ U$,$ W$\}$ and rules

P $=\{$S $->$ aSc $|$ UW $|$ from $|$ U bc$,$

U $->$ aU b $|$ away,

W $->$ bW c $|$ bc$\}.$

Let L$($G$)$ be the language generated by G$.$

$1.$ Create a grammar G$$

in Chomsky normal form such that L$($G$)=$ L$($G$$

$).$