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

import java.util.*; class Ch8Samplel { public static void main(String[] args) { Scanner scanner; scanner= new Scanner (System.in); int x, n, answer; System.out.printin(); System.out.print ("Enter an integer for x: "); x= scanner.nextInt (); System.out.print ("Enter an integer for n: "); n scanner.nextInt (); System.out.println(); if (x>=0 && n>=0 && ! (x== 0 && n==0)) { answer = power(x, n); System.out.println("The answer is " + answer); } else System.out.println ("Power not calculated"); } public static int power (int x, int n) { int answer; if (n > 0) else answer power (x, n-1) *x; answer 1; 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