The Euclidean algorithm for the greatest common divisor is in which class of Decrease$-$and$-$Conquer algorithms?

a$.$ decrease infinitely many times

b$.$ decrease by a constant amount

c$.$ decrease by a constant factor

d$.$ decrease by a variable amount and factor