b. We have n unique items. For i = 1,2,3,...,n, each item has a weight w;> 0 and value V;> 0. Write a greedy algorithm to find the maximum value of items that can be carried in a knapsack with a maximum weight capacity of W. An item may be broken into pieces and only a fraction put into the knapsack. It should take an array of weights, an array of item values and the weight limit of the knapsack as input. The array of weights and items are ordered such that w; corresponds to the same item as Vi. Write a C program