Section B.1 includes a C program that calculates the greatest common divisor of two integers.
a. Describe the algorithm in words and show how the program does implement the Euclid algorithm approach to calculating the greatest common divisor.
b. Add comments to the assembly program of Figure B.3a to clarify that it implements the same logic as the C program.
c. Repeat part (b) for the program of Figure B.3b.