Implement the Consecutive Integer Checking algorithm for finding the greatest common divisor of two positive integers m and n as a procedure or method in a programming language of your choice. Include a counter in your implementation to record the number of integers that are checked before the answer is found for each pair of input. Write a main program to generate 100 pairs of integers randomly between 1000 and 20,000 and call the consecutive integer checking method for each pair. Determine which pair requires the most number of iterations, which pair requires the least number of iterations, and the average number of iterations overall. Output from your program should look like the following:

The most number of iterations used is (?) for GCD(?, ?) = ?. The least number of iterations used is (?) for GCD(?, ?) = ?. The average number of iterations used for all 100 pairs is (?).

Each question mark (?) above should show a specific number.

Implement the Euclids algorithm as a procedure or method in the same way and gather the output result for the same 100 pairs of randomly generated integers. Compare the output results from the two solutions and describe the difference in the number of iteractions used.