<prompt> Given three numbers, find the greatest common divisor gcd of the three numbers.  <response>: To find the greatest common divisor GCD of three numbers, you can use the Euclidean algorithm. This algorithm works by iteratively applying the following operation until the GCD is found:1. choose two of the three numbers, lets say a and b, such that a is greater than b2. replace a with the remainder obtained when a is divided by b3. swap a and bThen, apply the above operation to the two other pairs, that is, b and c and then a and c. When the three numbers become equal, they represent the GCD of the original numbers. You can also find the GCD of the three numbers more easily by using the following relation: gcda, b, c gcdgcda, b, c. This means you can first find the GCD of any two numbers and then find the GCD of their GCD and the third number.Here is an example Python code that implements the second method:pythonfrom math import gcddef find_gcda: int, b: int, c: int - int: return gcdgcda, b, cExample Usage:pythonprintfind_gcd10, 15, 20 5printfind_gcd14, 28, 35 7 