In this lab, you will determine the least common multiple (LCM) of two numbers in memory named datax and datay. The calculated LCM value should be stored in the area of memory directly following the...

Extracted text: In this lab, you will determine the least common multiple (LCM) of two numbers in memory named datax and datay. The calculated LCM value should be stored in the area of memory directly following the given data. To calculate the LCM, you can first find the greatest common divisor (GCD) of the two numbers and use the formula LCM(xy)*GCD(x,y) = x*y. To find the GCD, you can use Dijkstra's Algorithm to forgo the use of division or modulus functions. Pseudocode (C code) for Dijkstra's Algorithm used to find the GCD is as follows: int GCD(int x, int y) { if(x == y) return x; else if(x > y) return gcd(x-y, y); else return gcd(x, y-x); } Notice that you are passing values in and out of subroutines, which is the focus of lecture this week. You may choose any of the 3 methods (pass by registers, reference, or stack) that you feel is most appropriate.