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. Maximum number of divisions (mod operation) made by Euclids algorithm among all inputs 1 m, n 512 (50 points)

2. Average number of divisions (mod operation) made by Euclids algorithm among all inputs 1 m, n 512 (50 points)

please code in JAVA i really need the second part

The first part of the code is included in the screenshot

public class GCD \{ public static int gcdDivisionCount (int a, int b, int counter) \{ if (a==0) return counter; counter +=1; return gcdDivisionCount(b\%a, a, counter); \} public static void main (String[] args) int min= Integer.MAX_VALUE; int max = Integer.Mij_VALUE; for(int m=1;m count ) \{ min= count; \} if(max