PLEASE ANSWER IN SageMath 9.2 Kernel

Write a function such that

• It takes as input a number N larger than 2 and a trivariate integer polynomial f (i.e. f is a polynomial in variables x,y,z).
• It outputs True or False, depending on whether or not f has a solution mod N. You should do this by iterating over all possible tuples (a,b,c) of integers mod N and directly testing if this triple is a zero of f mod N (DO NOT USE BUILTIN SAGE MODULUS FUNCTIONS, MAKE AN ORIGINAL)

def modularOriginal(N,f): #CODE