Pseudorandom generator: For the Question $6$ and $7,$ let $($PRG$)G$:$\{0,1{\}}^n\{0,1{\}}^{2n}$ 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.$

Q$6$: Define $G^{\text{'}}$:$\{0,1{\}}^n\{0,1{\}}^{4n}$ 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 Defination

Q$7$: Define $G^{\text{'}\text{'}}$:$\{0,1{\}}^n\{0,1{\}}^{6n}$ where $G^{\text{'}\text{'}}(x)$:$=G(y_1)||G(y_2)||G(y_1)o+G(y_2).$ Is $G^{\text{'}\text{'}}$ still a PRG$?$ If yes, explain why; if not, give an explicit attack that violates the PRG Defination