Greatest Common Divisor Given two integers as input, find the greatest common divisor (gcd) of them. GCD is the largest integer that divides each of the two integers. For example, given the numbers 12 and 15 The output will be 3 python

Starter code:

m = input("Input the first integer: ")

n = input("Input the second integer: ")