What is the modular inverse of a mod N? Use the Extended Euclidean Algorithm. Fill n the blank with your answer, a positive number x smaller than N, such that a*x = 1 mod N: a = 13 N = 255 The modular multiplicative inverse of a mod N is