Computer architecture question. Consider the following function fib, which computes a Fibonacci number of a given index. Discuss the instruction locality of the function. Is there good locality or bad locality? Is there spatial locality or temporal locality? Explain why. For ease of discussion, you may consider a particular execution of the function, say, fib(4).

int fib(int n) {

if (n < 2) {

return n;

}

int n1 = fib(n-1);

int n2 = fib(n-2);

return n1 + n2;

}