Exercise 5 (2 pts). The RSA definition requires that p g. Indeed, RSA cryptosystems are not correct in the case of p q, which means that Med is not necessarily equal to M. Review the proof of the RSA correctness in the slides or in the textbook (Proposition 7.3). This proof is basically a combination of three elements: Fermat's Little Theorem, the corollary to the Chinese Remainder Theorem, and simple algebra. Which of these three elements fails when pg