Let G and H both be pseudorandom generators with the same length function ((n)2 (so both G and H always add two to the length of their inputs). Define a new function F so that 2) and F(12)=H(x) (Thus, if F is given an input that starts with a 1, t outputs the result of applying G to the remainder of the bits. If it is given an input that starts with a 0, it outputs the result of applying H to the remainder of the bits.) Prove that F is a pseudorandom generator Let G and H both be pseudorandom generators with the same length function ((n)2 (so both G and H always add two to the length of their inputs). Define a new function F so that 2) and F(12)=H(x) (Thus, if F is given an input that starts with a 1, t outputs the result of applying G to the remainder of the bits. If it is given an input that starts with a 0, it outputs the result of applying H to the remainder of the bits.) Prove that F is a pseudorandom generator