Subject. Data structure

Please answer me correctly

Take your time no rush.

Answer full

Thank you.

2. Draw the recursion traces for the computation of power(2.5), using the the algorithms implemented in Code Fragment 5.8 and 5.9, below. What are the running time and space usages for each algorithm? Computes the value of x raised to the nth power, for nonnegative integer n 2 public static douible power double x int ) 4 return 1: 5 ebe retur" power(x, n-1): Code Frapmest S.8Computing the power function aing trivial recursion /** Computes the value of rased to the nth power for nonnegative integer n . 2 public static double powerl double x, int n) 4 returm 2: 6 double partial power,n/2) rely on truncated ivision of 7double result partial partial n(n % 2 .. 1) /odd, include etra factor of x 10 return resue Code Fragment 5.9: Computing the power function using repeated squaring