public class Fibonacci {
    private static final int MAX_TERM_VALUE = 10000;

    public static void main(String[] args) {
        System.out.println("This program lists the Fibonacci sequence.");

        int prevTerm = 0;
        int term = 0;

        while (term < MAX_TERM_VALUE) {
            System.out.println(term);

            if (term == 0) {
                term++;

            } else {
                term = prevTerm + term;
                prevTerm = term - prevTerm;
            }
        }
    }
}

@@ -204,24 +204,21 @@
     int 
-prevT
+t
 erm
+1
  = 0;%0A  
@@ -231,20 +231,21 @@
 int term
+2
  = 
-0
+1
 ;%0A%0A     
@@ -258,16 +258,17 @@
 le (term
+1
  %3C MAX_T
@@ -315,16 +315,17 @@
 tln(term
+1
 );%0A%0A    
@@ -336,109 +336,29 @@
     
-if (
 term
+2
  =
-= 0) %7B%0A                term++;%0A%0A            %7D else %7B%0A                term = prevTerm
+ term1
  + term
+2
 ;%0A  
@@ -371,53 +371,30 @@
     
-    prevT
+t
 erm
+1
  = term
+2
  - 
-prevTerm;%0A            %7D
+term1;
 %0A   

Refactor section assigment 2 problem 1