How to solve the following question
You are given two arrays of size N, W(weight) and V(values), an infinite quantity of an item is available, You have to maximize the sum of values such that total weight is less than capacity C and the total number of items taken is Fibonacci number
1 <= N <= 1000 1 <= C <= 1000 1 <= W(i) <= 1000 1 <= V(i) <= 1000