Outcome2: Design, implement and evaluate a computing-based solution to meet a given set of computing requirements in the context of the program's discipline. [Total marks 9.0 marks] Exercise4 [2.1: 1.5 marks] Design and implement ML function min of type int*int*int int that returns the smallest of three integers. Exercise5 Design and implement Prolog function that check whether a given integer number is prime. [2.2: 3.5 marks] Example: ?- is prime (7). Yes Exercise6 [2.3: 4.0 marks] Design and implement Prolog function that calculate the greatest common divisor of two positive integer numbers. Use Euclid's algorithm. Example: ?- gcd(36,63,G) G=9 Define ged as an arithmetic function; so you can use it like this: ?G is gcd(36,63) G=9