Let G: {0,1}" {0,1}2n be a PRG. For each of the following constructions, prove whether it is a PRG or not. 1. G1(s||t) = ? || G(3) 2. G2(s||t) = 3 || G(s) || t 3. G3(s) =0" @ G(s) 4. GA(s) = G(8) || 1sb(G(s)) (where lsb of a string is the last bit of the string) Let G: {0,1}" {0,1}2n be a PRG. For each of the following constructions, prove whether it is a PRG or not. 1. G1(s||t) = ? || G(3) 2. G2(s||t) = 3 || G(s) || t 3. G3(s) =0" @ G(s) 4. GA(s) = G(8) || 1sb(G(s)) (where lsb of a string is the last bit of the string)