Recursive implementation of fibonacci (non-optimized)

fib.js

const input1 = 7; // index
const input2 = 2; // index
const input3 = 3; // index

const fib = (index) => {
    if ((index === 0) || (index === 1))
        return index;
    
    return fib(index - 2) + fib(index - 1);
}

console.log(fib(input1));
console.log(fib(input2));
console.log(fib(input3));