Problem

1. Implement the classical version of Euclid's algorithm as described in the text.

2. Check what values your C system computes for u % v when u and v are not necessarily positive.

3. Implement a procedure to reduce a given fraction to lowest terms, using a struct fraction {int numerator; int denominator; .

4. Write a function int convert 0 that reads a decimal number one character (digit) at a time, terminated by a blank, and returns the value of that number.

5. Write a function int binary ( x) that prints out the binary equivalent of a number.