I need just the code ready to run

Assembly code

Greatest Common Divisor (GCD) The greatest common divisor (GCD) 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 pseudocode: int GCD(int x, int y) {x = abs(x)//absolute value y = abs(y) do {int n = x % y x = y y = n} while (y > 0) return x} Implement this function in assembly language and write a test program that calls the function several times, passing it different values. Display all results on the screen