This lab is an example of tail recursion. Implement the following recursive greatest common divisor function in assembly language. Convert the operation to a non recursive algorithm, and implement it also in assembly language. Pass parameters in registers, and place local variables also in registers. Implement 16-bit unsigned arithmetic. Design a main program to test the functionality of your solution. Measure the execution speed and required stack space of both versions for five different input values. Generalize the results.
