Create GCF code with Java with these specifications

Here is what I have so far:

I have no clue wat im doing

Sat rebl Thinking Prown 5. Implement 1. Opera Hellowered by Note med at 1. 4. Practice. Io an enemple 15 n) m=m-n; else n=n-m; among return m; Window Help -P3 !! - - - Hjava Test.java X D Utility.java Fraction java 1 public class Test { public static void main(String[] args) { String fraction-Fraction. Fraction(1,2); String fraction2-Fraction. Fraction1(2, 1); System.out.println("The Answer Is: "+ fraction); System.out.println("The Answer Is: "+ fraction2); vouw 10 //separate class (11 public class Utility { 12e static int findGCD(int n, int m) { 13 while(n!-m) { if(m>n) mem-n; else n=n-m; 14 return m; 19 } 24 22 //separate class 23 public class Fraction { int num; 25 int den; 26e static String Fraction(int top, int bot){ int num=top; int den=bot; return (num + "/" + den); 30 31 320 33 static int Fractioni(int n) { int num = n; int den = 1; return (num); 35 36 37e public String toString() { return (num + "/" + den); 40 ) 42