Help me in solving RECUR05 problem

help
,
1

My issue

solve this question

My code

import java.util.Scanner;

public class Main {
    static int fib(int n) {
        //Write your code here
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        System.out.println(fib(n));
        scanner.close();
    }
}

Learning course: Design and Analysis of Algorithms
Problem Link: Fibonacci Series in Design and Analysis of Algorithms