Sometimes the answer only supplies more questions
Firstly you need to understand what MOD does because the function recurses (reruns itself).
result = number1 Mod number2
GCD (a, b)
In the function becomes
GCD( b, the remainder of a/b )
This then divides (recourses) until there’s no...