Write a recursive method that gets two parameters as input: an array of integers called nums and an integer called index. The purpose of this method is to return the following: nums[index] * nums[index+ 1] * nums[index+ 2] * .. nums[nums.length-1]. Do not use loops. (java code)

Write a program called Recursive_fibonacci.java that implements a recursive function for computing the nth term of a Fibonacci Sequence. In the main method of your program accept the value of n from the user as a command-line argument and then call your function named Fibonacci with this value. The output should look exactly like what is pictured below.

Please help me with the below using java. Please also comment the code (explai. What each li e is doing). Please make sure both codes are completed using recursion

In Java (Use the isPrime Method) PrimeNumberMethod.java, provides the isPrime(int number) method for testing whether the number is prime. Use this method to find the number of prime numbers less than 10000. Below are some clarifications for the Java program   (a) The lab is to COUNT the prime numbers less than 10000.  Do NOT list the prime numbers. (b) A pair prime is two prime numbers whose difference is 2. For e.g. 3,5; 11,13; 17, 19; etc. We can use IsPrime function to count how many pair primes are there in a range from 2 to 100 for example.  Create a function pairPrime, that takes one argument. pairPrime should return the number of pair primes between 2 and the argument passed. Use the pairPrime function to count the pair primes  between 2 and 1000.  Make use of the IsPrime  function to solve this task. (This feature is worth 8 points). Use the compile/run button to test tour program. Include the output displayed. It will be similar to: command>javac…

JAVA: Which is/are correct statement(s) about the Recursion? (Select all that apply) We can use for loop and while loop in recursion. We solve a problem that depends on solving smaller occurrences of the same problem. We have high performance while using recursion rather than iteration. We have high performance while using iteration rather than recursion. Easy to implement the algorithm while using recursion but hard to find the time complexity. Easy to implement the algorithm while using iteration but hard to find the time complexity. Base case is a simple occurrence that cannot be answered directly. Recursive case is a more complex occurrence of the problem that cannot be directly answered, but can instead be described in terms of smaller occurrences of the same problem. We must have exact one base case and one recursive case. We must have at least one base case. We must have at least one recursive case.