Implement in Scheme Euclids algorithm computing the greatest common divisor of two integers as a tail recursive function.

What is the class of arithmetic functions that can be written in tail recursive way? Hint: Generalize out of examples you are familiar with.