This is Cryptography. Please write clearly and to the point. Thank you!!

2 Here is an RSA zero knowledge. Peggy claims that she knows an RSA plaintext. That is, n,e,c are public and Peggy claims that she knows m such that m = c (mod n). She wants to prove this to Victor using a zero-knowledge protocol. Peggy and Victor perform the following steps: (a) Peggy chooses a random integer r and computes r2 = mr-1 (mod n) (assume that gcd(ri, n) = 1.) (b) Peggy computes x1 = r and X2 = rm (mod n) and sends X1, X2 to Victor. (c) Victor checks that X112 = c (mod n). Give the remaining steps of the protocol. - = 2 Here is an RSA zero knowledge. Peggy claims that she knows an RSA plaintext. That is, n,e,c are public and Peggy claims that she knows m such that m = c (mod n). She wants to prove this to Victor using a zero-knowledge protocol. Peggy and Victor perform the following steps: (a) Peggy chooses a random integer r and computes r2 = mr-1 (mod n) (assume that gcd(ri, n) = 1.) (b) Peggy computes x1 = r and X2 = rm (mod n) and sends X1, X2 to Victor. (c) Victor checks that X112 = c (mod n). Give the remaining steps of the protocol. - =