Write the egcd function using the hints in the editor file. write a function called multinv that is given two integers (a and n) and returns the multiplicative inverse of a mod n. hint: call egcd(a, n) and return the first element of the tuple that you get back, modulo n. write a function called decrypt that accepts three numbers (c, m, and k) and returns the corresponding plaintext (p) value as a number. you can assume the modulus (n) is 256. you will need to compute the multiplicative inverse of m mod 256 to decipher c. write a function called decryptstring that accepts a ciphertext byte string, a multiplier (m), and shift amount (k). it returns an array of integers containing the decrypted values. for example, decryptstring(b'\xa7j##\x80', 31, 15) should return [104, 101, 108, 108, 111]. finally, write a function called lineardecipher that accepts a ciphertext byte string, a multiplier (m), and a shift amount (k). it returns the corresponding plaintext byte string.