6. Now consider the converse of Fermat's little theorem: Given n, a E Zt, if gcd(a, n) = 1 and an-1 = 1 (mod n), then n is a prime number. a. Let n = 561 and use your repeated squaring algorithin to compute an-1 mod n for b. Use your Euclidean algorithm function to compute gcd(a,n) for n = 561 and a = c. For those values of a, can you conclude that n is prime ( i.e. can you conclude that a-2,4,5,7,8. 2,4,5,7,8 the alternative statement true)? Use your factoring function to determine if 561 is prime, why do you think n = 561 is referred to as a pseudo-prime"? 6. Now consider the converse of Fermat's little theorem: Given n, a E Zt, if gcd(a, n) = 1 and an-1 = 1 (mod n), then n is a prime number. a. Let n = 561 and use your repeated squaring algorithin to compute an-1 mod n for b. Use your Euclidean algorithm function to compute gcd(a,n) for n = 561 and a = c. For those values of a, can you conclude that n is prime ( i.e. can you conclude that a-2,4,5,7,8. 2,4,5,7,8 the alternative statement true)? Use your factoring function to determine if 561 is prime, why do you think n = 561 is referred to as a pseudo-prime