Nelson sets up what he believes is a zero-knowledge protocol. The integer n is the product of two large primes p and q and he wants to prove to Victor that he knows the factorization of n without revealing to anyone the actual factors p, q. He devises the following procedure: Victor chooses a random integer x (mod ()n), computes y 2,2 (mod n), and sends y to Nelson. Nelson then computes a square root z of y and sends z to Victor who verifies that 2 y (mod n). Nelson offers to repeat this 10 times with different values of y. a) Should Victor be convinced that Nelson knows p and q? b) Is Victor able to use all this information to factor n? (In which cases this isn't a zero-knowledge