It is possible to extend the Euclidean algorithm in order to find the greatest common factor of more than two numbers. To find the greatest
common factor of three numbers first find the greatest common factor of the first two numbers, then find the greatest common factor of that
result and the third number. Use the Euclidean algorithm as just described to find the greatest common factor of 72, 96, and 132.
The greatest common factor of 72, 96, and 132 is?