How to solve the following question
You are given two integer arrays of size N, W(weight) and V(values), an infinite quantity of any item is available, You have to maximize the sum of values such that total weight is less than or equal to capacity C and the total number of items taken is a Fibonacci number
1 <= N <= 1000
1 <= C <= 1000
1 <= W(i) <= 1000
1 <= V(i) <= 1000
P.S. This was an interview question
Please specify the source and restriction of the problem.
Please elaborate the problem. I'm unable to understand the question being asked.
The dp-solution would be