On average, how much faster is Euclid$$s algorithm compared to checking consecutive integers from min$($m$,$n$)$ down to gcd$($m$,$n$)?$ Select the best approximation.

Group of answer choices

$2000$ times faster

$1000$ times faster

$3000$ times faster

$4000$ times faster