Given two positive integers, find their greatest common divisor using no divisions (see th...

Given two positive integers, find their greatest common divisor using no divisions (see the preamble to Exercise).

Exercise

The greatest common divisor of two positive integers can be found by an algorithm that uses only subtractions, parity checks, and shifts of binary expansions, without using any divisions. The algorithm proceeds recursively using the following reduction:

(Note: Reverse the roles of a and b when necessary.) Exercises refer to this algorithm.

Find (2106, 8318) using this algorithm.