You will get input from a file called H8.in. Input consists of integers representing the numerator and denominator of fractions. NOTE that some numerators and some denominators will be negative. As you input 2 integers create a Fraction object. Output the Fraction. (I want to see that your gcd method is working even for negative numbers). I DO NOT want to see any negative denominators. If both numerator and denominator are negative make both positive, if the denominator is negative but the numerator is positive then flip those signs so that the numerator is negative and the denominator positive. This is so that you do not output 3/-4, but rather -3/4. DO NOT store these Fractions in any data structure (such as an array or ArrayList). Just keep track of the biggest and the smallest. At the end of your program output the biggest and the smallest. You will need to alter your Fraction class to include a compareTo method, and you will need to consider carefully how you know one fraction is less than another. Here is what I have so far please edit or add:

public static class Fractions { //Attributes private int numerator; private int denominator; //Constuctors public Fractions() { numerator = 0; denominator=1; } public Fractions(int n, int d) {

} //Setters and gettrs public int getNumerator() { return numerator; }

public void setNumerator(int n) { this.numerator=n; }

public int getDenominator() { return denominator; }

public void setDenominator(int d) { this.denominator=d; } //toString public String toString() { return numerator + "/" + denominator; } //Calculates greatest common factor private int gcd(int int1, int int2) { if ((int1 % int2) == 0) { return int2; } else{ return gcd(int2, int1 % int2); } } public int compareTo(Fractions f) {

} public static void main(String[] args) { //Initialize the file File inFile = new File("H8.in"); Scanner fileInput = null; //try and catch try { fileInput = new Scanner(inFile); } catch (FileNotFoundException e) { }