Greatest Common Divisor Write an assembly procedure called GCD to find the greatest common divisor of two integers. The procedure should accept two 32-bit signed integers in the EAX and EBX registers. The procedure should return the result in the EAX register. A pseudocode version of the GCD algorithm appears in programming exercise 6 on page 285 of the textbook. Using the Irvine library, write a test program that prompts for two integers, calls your GCD procedure, and displays the result.