4. Implement Euclid's Algorithm for finding the greatest common divisor of two integers

def gcd(a, b):

# Provide the correct implementation

return b

print gcd(128, 60)

# Expected output: 4

4. Implement Euclid's Algorithm for finding the greatest common divisor of two integers def gcd(a, b) # Provide the correct implementation return b print gcd(128, 60) # Expected output: 4