Consider the Fiat-Shamir protocol in Figure 9.32. Suppose that the public values are TV = 55 and v = 5. Suppose Alice sends x = 4 in the first message, Bob sends e = 1 in the second message, and Alice...

Consider the Fiat-Shamir protocol in Figure 9.32. Suppose that the public values are TV = 55 and v = 5. Suppose Alice sends x = 4 in the first message, Bob sends e = 1 in the second message, and Alice sends y = 30 in message three. Show that Bob will verify Alice's response in this case. Can you find Alice's secret 5?