need this code in java please

Students: Section 7.10 is a part of 1 assignment: Module 2 Coding Assignment Requirements: za zab 7.10 LAB: Fibonacci sequence (recursion) The Fibonacei 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 fibonacei0 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: fibonaces (7) is 13 Note: Use recursion and DO NOT use any loops. Lan Activirr LabProgram.java Load defoult template :- 1 import java, util. Scanner; 7. 10.1:LAB, Fibonacci sequence (recursion)