Let $F,G:\{0,1\}^n\rightarrow\{0,1\}^{2n}$ be pseudorandom generators. For each of the functions below, prove or disprove that $H$ is necessarily a pseudorandom generator.
$H(s_0s_1...s_{n-1}):=G(s_{n-1}s_{n-2}...s_0),$ where $s_0,s_1,...,s_{n-1}$ are single bits.
I know that above given $H$ is not a pseudorandom generator but can someone help me or give a start on how to prove this.