PLEASE WRITE IN PYTHON

USING JUPYTER NOTEBOOK

Problem 1: Create a function modinv (a,m) that returns the smallest, positive inverse of a modulo m. If the gcd of a and m is not 1 , then you must raise a ValueError with message "The given values are not relatively prime" . You may NOT use any built-in functions as part of your implementation, but you may use any functions you implemented in previous coding assignments. Please make sure to copy and paste them into this file, so that they are uploaded to CodePost when you submit your pa3.py file. def modinv (a,m) : """returns the smallest, positive inverse of a modulo m INPUT: a - integer m-positiveinteger OUTPUT: an integer in the range [0,m1] """ pass