I want the solution in java.

Write a recursive method with the following signature: public static double recursiveSeriesSum(int n) This method takes a positive integer n and returns the sum of the following series: + + + 1 1 1 + + y = + log(2) log(3) log(4) log(5) log(n) Implement an iterative solution to the same problem in a different method with the signature: public static double iterativeSeriesSum(int n) In your main method, call the recursive method with three values (use of Scanner class is mandatory). Also call the iterative method with the same three values to verify that both your solutions are working correctly. Example: For n = 5, you need to compute 1 + + + and the log(2) log(3) + log(5) log(4) sum is 4.695616722519895 Note: Math.log() in Java actually computes the log of base e. Math.log100) computes the log of base 10. The above sample output has been derived using Math.log() method. Sample: Using recursive method: Enter n: 5 4.695616722519895 Enter n: 8 6.248524038403881 Enter n: 2 2.4426950408889634 Using iterative method: Enter n: 5 4.695616722519895 Enter n: 8 6.248524038403881 Enter n: 2 2.4426950408889634