(Euclid's Algorithm) Write a program gcd.py that takes two integers x and y as command-line arguments and writes their greatest common divisor (gcd) computed using Euclid's Algorithm: if y divides x, the gcd of x and y is y; otherwise, the gcd of x and y is the same as the gcd of y and x mod y.
$ python3 gcd.py 54 24
6
$ python3 gcd.py 22 45
1