Fibonacci function v2 Implement a modified version of the Fibonacci function from task part 2(b) by, based on the previous task part, now even more suitably including the store in an array declared in main(). The signature should look like this: int fibonacciBuffer (int n, int array[]); Using the additional array, the performance is to be improved by reusing values that have already been calculated in a previous recursion step when the function is called again (the following image serves as inspiration: as you can see, f(2) is unnecessarily calculated three times in a naive approach). three times). Then output all field values for testing.

by using c programming language: