1. (a) Define the term modular multiplicative inverse in plain English. Describe how it is used in RSA key generation.

(b) Describe in plain English, a simple method to probabilistically test for primality that does not rely on simply dividing the chosen value by integers smaller than it. Confirm the method by testing the value 11 for primality using the number, a = 2. Is it possible to use the outcome of the test to be absolutely certain the chosen value is a prime?