Problem 7 (10 points) Obtain the optimal solution of knapsack problem in the following settings: The total capacity of the bag C is 15(C=15), and there is a maximum number of 7 items (N=7) with W1=2,W2=3,W3=5,W4=7,W5=1,W6=4,W7=1 and P1=10,P2=5,P3=15, P4=7,P5=6,P6=18,P7=3 their corresponding weights and values, respectively. Use the notations foptimal and fgreeis to represent the optimal solution and that obtained by greedy method in non-increasing order of the value of item Pi. What's the ratio of fgreedfoptimal