Pseudo randomness. Suppose that $PRG$:$\{0,1\}\{0,1{\}}^{p(n)}$ is a pseudo$-$random generator that expands an $n-$bit string to a $p(n)-$bit string where

$p(n)>n$ is a polynomial. We use it as follows. We sample a seed $s$ and flip the first bit of $s$ to form $s^{\text{'}}.$ Then we define $PRG(s)=PRG(s)|PRG(s^{\text{'}}).$ Is

$PR{G}^{\text{'}}$ a pseudo$-$random generator?

a$)$ No

b$)$ It depends on how PRG is defined.

c$)$ Yes