Write a Java program that includes a recursive function to calculate the Fibonacci series up to a given term. The Fibonacci series is defined as follows:

$$ The first two terms are $0$ and $1.$

$$ The subsequent terms are the sum of the two preceding terms.

Mathematically: F$(0)=0,$ F$(1)=1,$ and for n $>=2,$ F$($n$)=$ F$($n$-1)+$ F$($n$-2).$

Implement a recursive function called calculateFibonacci$($int n$)$ that calculates the nth term of the Fibonacci series using recursion.

In the main method, prompt the user to enter an integer n $($where n $>=0)$ and then call the calculateFibonacci function to compute and display the nth term of the Fibonacci series. The program should not accept non$-$negative integer n and an error message must be displayed. The program should also calculate and display the time it takes to complete execution $($Hint: Use System.nanoTime to get current time snapshot in nanoseconds$).$