We're using recursion to ask a user for a number "N", then calculate the following items:

N! (N factorial) - the product of all the numbers from 1..N.

The Nth Fibonacci number (1, 1, 2, 3, 5, 8, ... look it up in Wikipedia).

The sum of all numbers between 1 and N.

Create a custom program, recursion.java, that prompts the user to enter a number. Then, using recursion, find the summation, factorial, and the Nth Fibonacci for the number given. NOTE: make sure your program does not fail if an invalid response is given.

Sample Output:

Enter a positive integer: 5 The product of the numbers from 1 to 5 (5!) is: 120 

The sum of the numbers from 1 to 5 is: 15 

The 5th Fibonacci number is: 5