Assembly language

Hello, as you can see,,,

there are two part in this assignment. the divisor in the first and extra credit ( loops ). just make sure to see the red stars which is the most important things.

if you have any question let me know.

thanks!!

CS 245 02
Programming Assignment 05
Chapter 05
15 Points
Due: Thursday, April 20, 2017 at the beginning of class
If not turned in at the beginning of class (no later than 2:10) lose 2 points
If not turned in by the end of class (no later than 3:15) lose 5 points
If not turned in by the end of the day (5:00pm) the grade will be 0
The greatest common divisor of two positive integers is the largest integer that evenly divides both
numbers. The following algorithm will find the greatest common divisor of number1 and number2.
gcd := number1;
remainder := number2; ;
repeat
divident := gcd;
gcd := remainder
remainder := dividend mod god
until remainder = 0
Using the windows32 framework, write a program that uses dialog boxes to prompt for and input values
for number1 and number2, implements the above design to find their greatest common divisor, and
uses a message box to display the GCD.
* Add the following comments to the beginning of the program.
Name:
Your Name
Class and Section: CS 245 02
Assignment:
Program Assignment 05
Due Date:
See above
Date Turned in:
Program Description: You write a short description of what the program will do
When you complete the program, do the following.
1. Create a folder with the following name: Assignment05
2. Copy and paste your program into Notepad or Notepad++ and save it to the folder with a .txt
extension.
3. Copy the folder to your folder in the I:\kopp\inbox\CS 245 02 folder
4. Print a copy of the source code and turn it in.
Extra Credit – 5 points
Add loops to the program to verify that both numbers input are greater than 1.