use Java and Eclipse to develop a program that implements Euclid's algorithm for finding the greatest common divisor of two positive integers.

The inputs to the algorithm will be supplied as command line arguments when the program is executed, as discussed in lecture.

The program must be submitted as an executable JAR file that contains your ".java" Java source file in addition to the ".class" Java executable file

Euclid's algorithm computes the greatest common divisor of two input positive integers. The greatest common divisor is the largest positive integer that divides evenly into both of the input values.

The algorithm uses the Definition of Division, which states that for any two integers a and b, there exist integers q and r such that a = q ( b ) + r. In this representation, q is the quotient and r is the remainder.

Given two positive integers a and b, the algorithm proceeds as follows:

1. For the given values of a and b, apply the Definition of Division and compute the quotient q and remainder r;
2. If r > 0, then update a and by by assigning the value of b to a and also assigning the value of r to b, and then repeat Step 1 with the updated values.
3. If r = 0, then the greatest common divisor of the original a and b is the last computed non-zero value for r.

the output should look like this:

Euclid's Algorithm by : Inputs: 5763, 187 5763 = 30 ( 187 ) + 153 187 = 1 ( 153 ) + 34 153-4 34) + 17 34=2(17 ) +0 -> gcd( 5763, 18717