Assembly code using visual studio needed ASAP. The code must run please. No errors please and include

screenshots of the code running

Write a non-recursive algorithm to find the greatest common divisor of two positive numbers.

Using visual studio Windows32 farmwork 80x86 to write the question.

This is called Euclidean algorithm

Your program should read the two positive integers using dialog boxes. If they are not positive, a message box should be displayed with an appropriate message.

Your program needs to have a procedure that takes two positive integers as parameters.

You need to follow cdecl protocol for parameter passing.

Display the valid result returned from your procedure using a message box.

1 .586 2 .MODEL FLAT 4 INCLUDE io. h header file for input/output 6 STACK 4096 8 DATA 9 nunber1 DWORD? 10 nber2 DWORD ? 11 pronpt1 BYTE Enter first number, 0 12 pronpt2 BYTE 13 string BYTE 40 DUP?) 14 resultLbl BYTE The nax R is 15 sun BYTE 11 DUP (?), 0 "Enter second nunber 0 17 .CODE 18 MainProc PFOC input prompt, string, 40 atod string read HsCIIl characters 20 convert to integer : store in nemory nunber1, eax 23 24 input prompt2, string, 40 atod string mOV repeat for second number nunber2, edx mov eax, numberl1 mov edx, number2 29 1 .586 2 .MODEL FLAT 4 INCLUDE io. h header file for input/output 6 STACK 4096 8 DATA 9 nunber1 DWORD? 10 nber2 DWORD ? 11 pronpt1 BYTE Enter first number, 0 12 pronpt2 BYTE 13 string BYTE 40 DUP?) 14 resultLbl BYTE The nax R is 15 sun BYTE 11 DUP (?), 0 "Enter second nunber 0 17 .CODE 18 MainProc PFOC input prompt, string, 40 atod string read HsCIIl characters 20 convert to integer : store in nemory nunber1, eax 23 24 input prompt2, string, 40 atod string mOV repeat for second number nunber2, edx mov eax, numberl1 mov edx, number2 29