Pseudorandom generator: Let $($PRG$)$ G : $\{0,1\}">\{0,1\}",$ be a pseudorandom generator and let's denote G$($x$)=$ y$1||$ y$2,$ where y$1,$ y$2$ are both n$-$bit strings, and we use G$1($x$)$ to represent y$1,$ and G$2($x$)$ to represent y$2.$ Question: Let us define G$3($x$)$ as G$1($x$)||$ G$2($x$)||$ G$1($x$)$ G$2($x$)1010.\mathrm{.}10,$ where $1010.\mathrm{.}10$ is an n$-$bit string, argue that G$3(-)$ is not a PRG$.$