In this exercise, you are exposed to two important algorithms for computing the multiplicative inverse of an operand over a nite eld. These algorithms are Fermat's Little Theorem (FLT) and Extended Euclidean Algorithm (EEA). The nite eld is constructed over p = 217 1 (Mersenne prime from the previous exercise). You should write a C code and compute the multiplicative inverse of a = 51 over F p using:

(a) Fermat's Little Theorem (FLT)

(b) Extended Euclidean Algorithm (EEA)