The greatest common divisor of two integers is the largest integer that will evenly divide both integers. The GCD algorithm involves

integer division in a loop, described by the following given C++ code:

int GCD(int x, int y) { x = abs(x); // absolute value y = abs ; do { int n = x % y; x = y; y = n; } while y > 0; return y; }

Implement this function in the assembly language and write down a test program which calls function many times, passing it several values. Show all results on screen and include screen shots of the outputs.