P8) Given a recursive function (40 points) F(0) = 0 F(1) = 1 F(2) = 2...

 

Transcribed Image Text:

P8) Given a recursive function (40 points) F(0) = 0 F(1) = 1 F(2) = 2 F(n) = F(n-1)+F(n-2) + F(n-3) For example, F(3) = F(2) + F(1) + F (0)=2+1+0=3 F(4)= F(3) + F(2) + F (1) = 3+2+1 = 6 a) Write a Java code for this function in recursive way. b) Write a Java code for this function using a "for-loop". P8) Given a recursive function (40 points) F(0) = 0 F(1) = 1 F(2) = 2 F(n) = F(n-1)+F(n-2) + F(n-3) For example, F(3) = F(2) + F(1) + F (0)=2+1+0=3 F(4)= F(3) + F(2) + F (1) = 3+2+1 = 6 a) Write a Java code for this function in recursive way. b) Write a Java code for this function using a "for-loop".

Answer rating: 100% (QA)

Here are the Java implementations for both parts a Re... View the full answer