I need this answer in java please

The Fibonacci sequence bogins 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 fibonaccio method, which takes in an index, n, and retums the nth value in the secuence. Any negative index values should return -1. Ex. If the input is: 7 the output is: fibonacci{7}is13 Note: Use recursion and DO NOT use any loops. LABACTIVITY6.10.1:LAB:Fibonaccisecuence(recursion)0/10 LabProgram.java Load default template.- 1 import java.util. Scanner; Note: Use recursion and DO NOT use any loops