Problem
1. Give all the values that u and v take on when gcd is invoked with the initial call gcd (12345, 56789).
2. Exactly how many C statements are executed for the call in the previous exercise?
3. Write a program to compute the greatest common divisor of three integers u, v, and w.
4. Find the largest pair of numbers representable as integers in your C system whose greatest common divisor is 1.
5. Implement Euclid's algorithm in FORTRAN or BASIC.