Need help with part 2! Java please, will give thumbs up

Part 1 Write a complete, well documented program in one file, that prompts the user for input and tests a recursive function. You will write a function that implements recursion and produces the following output: Sample is for input of 4: Note: indentions are required for credit. This was written by call number 1. This was written by call number 2. This was written by call number 3. This was written by call number 4. This was ALSO written by call number 4. This was ALSO written by call number 3. This was ALSO written by call number 2. This was ALSO written by call number 1. In this example, the recursion stopped when it reached four levels deep (because 4 was input), but your program should be capable of continuing to any specified level. Part 2 (put in same program) Write a recursive function called sumover that has one argument n, which is an unsigned integer. The function returns a double value, which is the sum of the reciprocals of the first n positive integers. (The reciprocal of x is the fraction 1/x). For example, sumover(1) returns 1.0 (which is 1/1); sumover(2) returns 1.5 (which is 1/1 + 1/2; sumover(3) returns approximately 1.833 (which is 1/1 + 1/2 + 1/3). Define sumover(0) to be zero. Do not use any local variables in your function (accept input for n)