Using Masm assembly / Irvine library

1. Write a procedure that will find the greatest common divisor of two 16-bit integer, your program should accept positive and negative numbers, write a test program that calls the procedure several times, passing it different values. Display all results on the screen. int greatestCommonDivisor (int x, int y) { x = abs(x) // absolute value y = abs(y) do { int n = x % y ; use DIV instruction to get the Remainder x = y y = n } while (y > 0) return x } Hint: to find-out the absolute value, you need to check if the number is less than zero (use Jumps Based on Signed Comparisons like JG and JL To get the absolute value of the negative values you need use NEG instruction.