Euclid's algorithm will take a large number of steps to deliver the final ged if the sequenee of remainders only deereases by a small number at eaeh step. Explain in general terms why this eannot happen.