Write a program RecursiveFibonacci that has a static method fibonacci() that uses recursion to calculate the nth Fibonacci number, where n is sent in to the method as a parameter. For this problem, use the modern definition of the Fibonacci sequence, where the 0th value is 0, the 1st value is 1, and all subsequent values are the sum of the previous two Fibonacci values.
Your program should also have a static main() method that demonstrates the recursive function fibonacci().