Implement Euclid’s GCD algorithm as a full class named Euclid. Recall the basics of the algorithm: 

For your output, can you think of a way to show the user the original values of a and b in addition to the common denominator? The ideal output would look something like this:

int a = 2701; int b = 222; while (b!= 0) { if (a > b) { b; } a = a } else { } b = b = a; System.out.println("GCD is " + a);