Question

NEED HELP THE PROBLEM-SOLVING PROCESS WITH THE UML DIAGRAM + ACTIVITY DIAGRAMS TO RUN THE CODE PROGRAM PLEASE!!

Problem1. (20 points) Recursive Coding Problem. Using the Problem Solving Process. Write a Java application that implements these two functions using recursive methods (recursion must be used).

1. First Recursive Function. When one passes an integer as input (n for example), the return should return (output) the sum as follows:

1 + 1/2 + 1/3 + 1/4 + ... 1/(n-1) + 1/n

Example:

If the function's argument is 4, the function should return the value of 2.083 which is the sum of: 1 + 1/2 + 1/3 + 1/4.

Sample Output:

This application will calculate the solution for the following function:

x = 1 + 1/2 + 1/3 + 1/4 + … 1/(n-1) + 1/n Please enter an integer: 4

x = 1 + 1/2 + 1/3 + 1/4 = 2.083.

2. Second Recursive Function. The second function when you pass it an integer (n for example) is supposed to print lines of asterisks in the following format:

*

**

***

****

****

***

**

*

Sample Output One:

Please enter an integer (1-10) an I will print a recursive Bar Chart: 1

*

*

Sample Output Two:

Please enter an integer (1-10) an I will print a recursive Bar Chart: 3

*

**

***

***

**

*

Summary, Given n, code will print n lines starting with one asterisk on line 1 followed by two asterisks on line 2, all the way to n asterisks on line n. Then, after line n print the mirror image of the first n lines.

Additional Guidance. You need to implement a main function in your class that will do the following:

1. Ask the user to read an integer (n)
2. Pass the integer to the first function and call it to return the sum.
3. Print the sum.
4. Ask the user to read another integer (can also be n)
5. Pass the integer to the second function to print the asterisks in the format mentioned.
   

Answer 1

import java.util.Scanner;
public class Main{
public static double sumfun(int n)
{
if(n==0)
{
return 0.0;
}
else
{
return sumfun(n-1)+1.0/(double)n;
}
}
public static void secondfun(int n,int num)
{
if(n-1==num)
{
return;
}
for(int i=0;i<n;i++)
{
System.out.print("*");
}
System.out.println("");
secondfun(n+1,num);
for(int i=0;i<n;i++)
{
System.out.print("*");
}
  
System.out.println("");
  
}
public static void main(String []args){
Scanner sc=new Scanner(System.in);
System.out.println("Enter n for sum: ");
int n=sc.nextInt();
System.out.println(sumfun(n));
System.out.println("Enter n for second function: ");
n=sc.nextInt();
secondfun(1,n);

}
}