Please include code (preferably in python)

Problem 1 (Primality Tests). Throughout nearly all of our Number Theoretic Cryptosystems and Digital Sig- nature Algorithms, we begin by selecting one or more prime numbers (Yay Primes!). This leads to a natural question, is there an easy/fast way to identify if a given number is prime? Answer: Sorta... We can easily say a number is probably prime - hooray for 'probably being prime :-). Recall: Via Fermat's Little Theorem, we obtain a quick test to see if a number is composite. Proposition 1 (Fermat Test). Let n be an odd integer. Choose an integer a with 1