Given the following code, what is its complexity for a list of length n. You nee

Given the following code, what is its complexity for a list of length n. You need to show working but not a formula. Ignore commented lines with โ#โ.

function nthFib(n) {

#let cache = {}; //Start here function recurse(num) {

#if(cache[num]) :

#return cache[num] //second step if(num === 0 || num == 1) return 1

let result =recurse(num-1)+recurse(num-2) # cache[num] =result; //final step

returnresult;

}

returnrecurse(n);

}