What is the minimum number of division steps required by the Euclidean algorithm when computing $\gcd(a, b)$ for any positive integers $a, b$?