1. Draw the recursion trace for the computation of power(2,5), using the traditional algorithm implemented in textbook Goodrich in Code Fragment 5.8: 1 /** Computes the value of x raised to the nth power, for nonnegative integer n. */ 2 public static double power (double x, int n) { 3 if (n == 0) return 1; 5 6 else return x power (x, n-1); 7)