An integer is said to be square$-$free if it is not divisible by any perfect square other than $1.$Write an ML function sqfree that checks whether an integer is square$-$free. You may assumethat $0$ is square$-$free.You may define auxiliary functions.For instance,$-$ sqfree;val it $=$ fn : int $->$ bool$-$ sqfree $10$;val it $=$ true : bool$-$ sqfree $75$;val it $=$ false : bool$-$ sqfree $63$;val it $=$ false : bool$-$ sqfree ~$123454321$;val it $=$ false : bool