Let G be a pseudorandom generator with length function ((n)1. Define a new function H by the rule where |r- 4. Thus H just passes the first 4 bits of its input through untouched and applies G to the last n 4 bits. Prove with a full reduction that H is a PRG. (You can ignore the behavior of H on inputs of length less than 4.0 Let G be a pseudorandom generator with length function ((n)1. Define a new function H by the rule where |r- 4. Thus H just passes the first 4 bits of its input through untouched and applies G to the last n 4 bits. Prove with a full reduction that H is a PRG. (You can ignore the behavior of H on inputs of length less than 4.0