Develop a nonrecursive implementation of the version of the power method from Code Fragment 5.9 that uses repeated squaring.

1 /** Computes the value of x raised to the nth power, for nonnegative integer n. */ 2 public static double power(double x, int n) { if (n == 0) return 1; else { double partial = power(x, n/2); double result = partial * partial; if (n % 2 == 1) result *= x; return result; 4 5 // rely on truncated division of n // if n odd, include extra factor of x 10 11 12 }