8.19 LAB: Fibonacci sequence (recursion) The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete...

Needs helps to complete this activity

Image is attached

Thank you.

Extracted text: 8.19 LAB: Fibonacci sequence (recursion) The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the fibonacci() method, which takes in an index, n, and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: fibonacci (7) is 13 Note: Use recursion and DO NOT use any loops. 318446.2220060.qx3zay7 LAB 8.19.1: LAB: Fibonacci sequence (recursion) 0/ 10 ACTIVITY LabProgram.java Load default template. import java.util.Scanner; public class LabProgram { public static int fibonacci (int n) { /* Type your code here. */ } public static void main (String[] args) { Scanner scnr = new Scanner (System.in); int startNum; startNum = scnr.nextInt () ; System.out.println ("fibonacci (" + startNum + ") is } + fibonacci (startNum));