Suppose that G is a pseudorandom generator; again you may assume that ((n)- n+ 1. Prove that P NP. (Hint: Consider the language Ig- 3, G(x). Prove that IG is in NP. If P NP, then lo P. Use this to break the pseudorandom generator.) (Take away message: You can't have interesting cryptography unless P NP.) Suppose that G is a pseudorandom generator; again you may assume that ((n)- n+ 1. Prove that P NP. (Hint: Consider the language Ig- 3, G(x). Prove that IG is in NP. If P NP, then lo P. Use this to break the pseudorandom generator.) (Take away message: You can't have interesting cryptography unless P NP.)