(1 point) This question concerns primality testing. Consider the composite number 309 . Recall Fermat's Little Theorem: For any prime p and integer a,ap11modp. It happens that the converse to FLT is often but not always true. That is, if n is composite and a is an integer, then more often than not an11modn. We can use this as the basis of a simple primality test, called the Fermat Test. For aZ309 we make the following definitions. 1) We call a a Fermat Liar for n=309 if an11modn, where a/(0,1,n1). 2) We call a a Fermat Witness for n=309 if an11modn, where a/(0,1,n1). Please answer the following. a) What is the first Fermat Liar in Z309 ? b) What is the first Fermat Witness in Z309 ? c) How many Fermat Liars are in Z309 ? Remember not to count 0,1 , or n1. (1 point) This question concerns primality testing. Consider the composite number 309 . Recall Fermat's Little Theorem: For any prime p and integer a,ap11modp. It happens that the converse to FLT is often but not always true. That is, if n is composite and a is an integer, then more often than not an11modn. We can use this as the basis of a simple primality test, called the Fermat Test. For aZ309 we make the following definitions. 1) We call a a Fermat Liar for n=309 if an11modn, where a/(0,1,n1). 2) We call a a Fermat Witness for n=309 if an11modn, where a/(0,1,n1). Please answer the following. a) What is the first Fermat Liar in Z309 ? b) What is the first Fermat Witness in Z309 ? c) How many Fermat Liars are in Z309 ? Remember not to count 0,1 , or n1