Implement two methods (using iterative and recursive approaches) to compute the sum of the reciprocals of the first n natural numbers. Mathematically, it can be denoted as follows: Sum(n) = 1 + 1 2+1 3 + ... + 1 n (1) Example 1: Input: [1] Output: [1.0] Explanation: n=1, so sum(1)=1.0 Example 2: Input: [2] Output: [1.5] Explanation: n = sum(2)=1+1/2=1.5 O Iterative Approach: public static float sum iterative (int n) { } 1 O Recursive Approach: Hint for recursive implementation: The prototype for the recursive approach should be as follows: Sum(n) = ( 1.0 if n == 1 Sum(n - 1) + 1/n if n > 1 (2) public static float sum recursive (int n) { = 2, so mas

Write a recursive function in Java that accepts an integer as input and returns 1 + 1/2 + 3 + 1/4 + ...(n or 1/n). The answer is the sum of the odd integers from 1 to n plus the sum of the reciprocals of the even integers.

python 3 Write a program that lists all ways people can line up for a photo (all permutations of a list of strings). The program will read a list of one word names, then use a recursive method to create and output all possible orderings of those names, one ordering per line. When the input is: Julia Lucas Mia then the output is (must match the below ordering): Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia question: is it any way that i can use ('if' statement as base case, and 'else' statement as recursive case) in the code below? thanks. code: def all_permutations(permList, nameList):# TODO: Implement method to create and output all permutations of the list of names.def createPermutationsList(nameList):f = len(nameList) if f == 0:return [] if f == 1:return [nameList] permList = [] for i in range(f):newList = nameList[i]remaining = nameList[:i] + nameList[i+1:]for p in createPermutationsList(remaining):permList.append([newList] + p)…

Using recursion, write a Java program that takes an input ‘n’ (a number) from a user to calculate and print out the Fibonacci using the following modified definition:   F(N) = 1                                                    if n = 1 or n = 2         = F((n+1)/2)2 + F((n-1/2)2           if n is odd         = F(n/2 + 1)2 – F(n/2 – 1)2         if n is even                                     Your solution must implement recursion to receive points for this question.