$5\mathrm{.}30$ LAB: Fibonacci sequence

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 has an index, $n($starting at $0),$ as a parameter and returns the $n$th value in the sequence. Any negative index values should return $-1.$

Ex: If the input is:

the output is:

fibonacci$(7)$ is $13$

Note: Use a for loop and DO NOT use recursion.

$535396\mathrm{.}2979738$ iqx$3$zay?

LAB ACTIVITY

$5\mathrm{.}30\mathrm{.}1$: LAB: Fibonacci sequence

LabProgram.java

LabProgram.java

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$))$

$\}$

$\}$

import java.util.Scanner

System.out.println$("$fibonacci$("+$ startNum $+")$ is $"+$ fibonacci$($startNum$))$