# The greatest common divisor of two positive integers is the

The greatest common divisor of two positive integers is thelargest integer that evenly divides both numbers.The following algorithm will find thegreatest common divisor of number1 and number2.gcd :=number1;remainder:= number2;repeatdivident:= gcd;gcd:= remainderremainder:= dividend mod gcduntilremainder = 0Using the windows32 framework, write a program that usesdialog boxes to prompt for and input values for number1 and number2, implementsthe above design to find their greatest common divisor, and uses a message boxto display the GCD.Extra Credit – 5 pointsAdd loops to the program to verify that both numbers input are greater than 1.