Trace the program in Fig. 8.10 for \(n=5\) and draw the tree similar to the one in Fig. 8.21 .

import java.util..; class Ch8Sample2 { public static void main(String[] args) { Scanner scanner;) scanner = new Scanner (System.in); int n, answer; System.out.println(); System.out.print ("Enter an integer for n: "); n = scanner.nextInt (); System.out.println(); } if (n >= 0) { answer fib(n); System.out.println("The answer is " + answer); } else System.out.println ("Fibonacci not calculated"); System.out.println(); } public static int fib(int n) { int answerl, answer2, answer; if (n > 1) { answerl= fib(n-1); answer2 fib (n-2); answer = answerl + answer2; } else answer n; return answer; // Line 1 // Line 2 // Line 3 // Line 4 // Line 5 // Line 6 // Line 7 // Line 8 // Line 9 // Line 10 // Line 11 // Line 12 // Line 13 // Line 14 // Line 15 // Line 16 // Line 17 // Line 18 // Line 19 // Line 20 // Line 21 // Line 22 // Line 23 // Line 24 // Line 25 // Line 26 // Line 27 // Line 28 // Line 29 // Line 30