The greatest common divisor of two positive integers, a and b, is the largest number that can be evenly divided into both of them. euclid’s algorithm can be used to find the greatest common divisor (gcd) of two positive integers. you can use this algorithm in the following manner: compute the remainder of dividing the larger number by the smaller number. replace the larger number with the smaller number and the smaller number with the remainder. repeat this process until the smaller number is zero. the larger number at this point is the gcd of a and b. write a program that lets the user enter two integers and then prints each step in the process of using the euclidean algorithm to find their gcd. an example of the program input and output is shown below: enter the smaller number: 5enter the larger number: 15the greatest common divisor is 5