Given the grammar G $=($V$,\backslash$Sigma $,$ R$,$ S$)$ with V $=\{$S$,$ U$,$ V$\}$ and $\backslash$Sigma $=\{$a$,$ b$\}.$

Step $5$ of the Chomsky normal form transformation is to eliminate all rules of the form A $->$ u$1$u$2,$ where u$1$ and u$2$ are not both variables.

Perform Step $5.$

If applicable, give intermediate stages.

Assume that you have given the following rules:

S $->$ bU $|$ UU

U $->$ Vb

V $->$ aa

If you need the special symbols in your solution, you can copy them from here: $\backslash$epsi $->$