I NEED THIS IN JAVA PROGRAMMING CODE!!!!! THANKS

Problem This problem considers several ways to compute x" for some n>0. a. Write an iterative method power to compute x" for n>0. b. Write a recursive method power2 to compute xu by using the following recursive formulation: x=/ xn = x*xn if n-1 if n>O c. Write a recursive method power3 to compute x" by using the following recursive formulation: x =1 x" = (xn/2)2 if n>0 and n is even x" = x* (xn//2)2 if n>0 and n is odd d. How many multiplications will each of the methods powerl, power2, and power3 perform when computing 332? 319? e. How many recursive calls will power2 and power3 make when computing 32 ? 319? d. How many multiplications will each of the methods powerl, power2, and power3 perform when computing 332? 319? e. How many recursive calls will power2 and power3 make when computing 32 ? 319