Answer:
The GCD of a, b is the largest positive number that divides both a and b without a remainder
Step-by-step explanation:
=60