Problem $3$: CFLs versus Regular Languages

Let $G=(V,,R,S)$ be a grammar with $V=\{S,T,U\},=\{0,$#$\},$ and the set of rules:

$STT|U$

$T0T|T0|$#

$U0U00|$#

A$.$ Describe $L(G)$ in English.

B$.$ Prove that $L(G)$ is not regular.