Cryptography Indistinguishability

Let f: {0, 1}^n rightarrow {0, 1}^n+1 be a pseudo-random generator (PRG). Define h: {0, 1}^n {0, 1}^n+1 as follows: h(x) = REVERSE(f(x)), , where REVERSE(y) stands for the reverse of the string y. Prove that h is a PRG. More precisely, you need to show that the distributions {h(U_n)} and {U_n+1} are indistinguishable