I need this in Assembly code

This started piece was provided so the code just have to be finished :

6. Greatest Common Divisor (GCDO 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 E abs (y) do 1 int n x y 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