The average-case efficiency of Euclid’s algorithm on inputs of size n can be measured by...

The average-case efficiency of Euclid’s algorithm on inputs of size n can be measured by the average number of divisions made by the algorithm in computing gcd(n, 1), gcd(n, 2), . . . , gcd(n, n). For example,

Produce a scatterplot of and indicate the algorithm’s likely average-case efficiency class.