Problem 2. (25 points) Suppose an algorithm is a secure pseudorandom generator (with bit strings as inputs and outputs). Let be the following algorithm. on input seed s, run G(s) to get w, then negate every bit of w to get w (i.e., for bit i, w-1w), and output the result. Prove that G is also a secure pseudorandom generator