Answer the following questions:

Question: A Fiat-Shamir protocol for entity authentication uses 11 challenge-response rounds to verify the claimant.

Problem 1: What is the probability that a dishonest claimant is falsely verified as an authentic entity, i.e., what is the probability that the dishonest claimant responds correctly to all 11 challenges?

Problem 2: A Guillou-Quisquater protocol uses an integer challenge c in the range [1, 20] inclusive, i.e., there are 20 different values for c.

What is the minimum value of challenge-response rounds needed so that the probability of falsely verifying a dishonest claimant is equal to or smaller than the probability obtained in part (a) for the Fiat-Shamir protocol?

Problem 3: A Guillou-Quisquater protocol uses an integer challenge c in the range [1, K] inclusive.

What is the minimum value of K such that only two rounds of the G-Q protocol are needed to get a probability strictly smaller than the probability obtained in part (a) for the Fiat-Shamir protocol?

Can you answer this problem using basic computer networking concepts and securities.