Slove by standard ML programming language

Exercise 5 Design and implement Prolog function that check whether a given integer number is prime. Example: 2- is prime(7). Yes Exercise6 Design and implement Prolog function that calculate the greatest common divisor of two positive integer numbers. Use Euclid's algorithm. Example: ? ged(36,63,G) G=9 Define ged as an arithmetic function; so you can use it like this: ?- G is ged(36,63). G=9