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

decrease by a constant factor

decrease by a constant amount

decrease infinitely many times

decrease by a variable amount and factor