Can someone please help with problem 4? I have to write a code that follows the step-by-step instructions seen in red in the Linux Mint software.

Problem 4. (Euclid's Algorithm) Write a program gcd.py that takes two integers a and y as command-line arguments and writes their greatest common divisor (gcd) computed using Euclid's Algorithm: if y divides r, the ged of r and y is y; otherwise, the ged of and y is the same as the gcd of y and r mod y s python gcd.py 54 24 6 s python ged.py 22 4.5 Linux Mint [Running gcd.py (/coursework/homework3) File Edit View Search Tools Documents Help *equality.py five_per_row.py rootpygcd.py gcd.py: takes two integers x and y as command-line arguments and # writes their greatest common divisor (gcd) computed using # Euclid's Algorithm. import stdio import sys # Get x and y from command line, as ints. # Repeat as long as x is not divisible by y. while . . . : # Set r to be the remainder of x divided by y; x to y; and y to r. # Write y (the GCD of x and y)