1.

2.

Consider a PRG, which is represented by the function G:K{0,1}n, where K is the key space. Let the output bits be denoted by b1,b2,,bn.G has the property that the output bits satisfy b1b2bn=1. Is G predictable? Yes, given the first bit, the second bit can be predicted. No, the individual bits cannot be obtained from their XOR value. Yes, given the first n1 bits, the last bit can be predicted. It depends on the choice of the key. Consider a random variable X, which has three possible outcomes {1,2,3}. The probability distribution of X is given by Pr(X=1)=0.47,Pr(X=2)=0.28, and Pr(X=3)=10.47 - 0.28. What is the entropy of X (correct to 2 decimal places)