let $($PRG$)$ G:$\{0,1\}^$n$\{0,1\}^2$n 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.$

Define G$\text{'}$:$\{0,1\}^$n$\{0,1\}^4$n where G$^\text{'}($x$)$G$($G$\_1($x$))||$G$($G$\_2($x$))$G$($y$\_1)||$G$($y$\_2).$ Is G$\text{'}$ still a PRG$?$ If yes, explain why; if not, give an explicit attack that violates the PRG definition.

Define G$\text{'}\text{'}$:$\{0,1\}^$n$\{0,1\}^6$n where G$^\text{'}\text{'}($x$)$G$($y$\_1)||$G$($y$\_2)||$G$($y$\_1)$G$($y$\_2).$ Is G$\text{'}\text{'}$ still a PRG$?$ If yes, explain why; if not, give an explicit attack that violates the PRG definition.