Write the following sums using recursion. (i.e. The first recursive sum will be

ID: 3545111 • Letter: W

Question

Write the following sums using recursion. (i.e. The first recursive sum will be computed in a recursive method based on the number the user inputs then the result will be inputed into a second method that uses the result of the first method to compute the second recursive sum in a second recursive method) I am more interested on how to derive the recursive sum and how to call the method from inside the method. The best clear answer gets all the points, thank you very much.

1 + 1/2 + 1/3 + 1/4 + ... 1/n

1+4+6+...2n