CS141 Lab #3

The Fibonacci series is defined as . Write a static method to recursively compute and return the n-th Fibonacci number given the value n as the input to the method. The amount of time it takes for a particular algorithm to complete a process is proportional to the expression, , where k is the constant of proportionality. Let T denote time. Then, . ................
................