Suppose we find the 8th term using the recursive implementation. The arguments passed to the function calls will be as follows:fibonacci(8)fibonacci(7) + fibonacci(6)fibonacci(6) + fibonacci(5) + fibonacci(5) + fibonacci(4)fibonacci(5) + fibonacci(4) + fibonacci(4) + fibonacci(3) + fibonacci(4) + fibonacci(3) + fibonacci(3) + fibonacci(2):::Which property is shown by the above function calls?

• A. Memoization
• B. Optimal substructure
• C. Overlapping subproblems
• D. Greedy