Hello, can you help me with this problem. I want to write a code to solve this problem.

Question

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.

Enter the smaller number: 5
Enter the larger number: 15

The greatest common divisor is 5

Answer 1

Thanks!