Write this program using assembly x86programming language. Use the Kip Irvine library (INCLUDEIrvine32.inc) on visual studios.
Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books and on the Web. Write a test program that calls your GCD procedure five times, using the following pairs of integers: (5,20), (24,18), (11,7), (432,226), (26,13). After each procedure call, display the GCD. Show transcribed image text Write
OR
OR