5. With the extended Euclidean algorithm, we finally have an efficient algorithm for finding the multiplicative inverse in Zm that is much better than exhaustive search. Find the inverse in m of the following element 'a' mod 'm': a 7, m 26 Note that the inverse must again be element in Zm and that you can easily verify your answer. You can use the EEA algorithm and construct the magic table (t in the table is the inverse) Compute the inverse of a mod m, with Fermat's Little Theorem (FLT). FLT is applicable in below case because 'm' is a prime number: 6. a 6, m 13