use Python

# Returns an arbitrary primitive degree-th root of unity modulo mod. # totient must be a multiple of degree. If mod is prime, an answer must exist. # Hint: function find_generator() is required. def find_primitive_root (degree, totient, mod): print ('degree, totient, mod', degree, totient, mod) nt.check_int (degree) nt.check_int(totient) nt.check_int(mod) if not (1