make sure is the fractional knapsack

(10 points) Let S a, b,c, d, e, f.g be a collection of items with weight-benefit values as follows: a(3. 12), b(6,12), c(6.9), d(1,5), e(25), f(10, 10), g(3.9). For example, ?tem a weighs 3 lbs and is worth a total of $12. What is an optimal solution to the fractional knapsack problem for S assuming we have a knapsack that can hold a total of 11 lbs? Show your work