Euclids algorithm is based on applying repeatedly the equality gcd(m, n) = gcd(n, m mod n), where m mod n is the remainder of the division of m by n, until m mod n is equal to 0.

Write a program to implement Euclids algorithm to find the following:

1. Minimum number of divisions made by Euclids algorithm among all inputs 1 m, n 256 (50 points)

2. Maximum number of divisions made by Euclids algorithm among all inputs 1 m, n 256 (50 points)

This is a Java Question