Let S={a,b,c,d,e,f,g} be a collection of objects with these (benefit, weight) values, a:(8,5),b(10,6),c:(12,4),d:(11,7),e:(9,6),f:(7,1),g:(14,7) What is the optimal solution for the fractional knapsack problem for S, assuming we have a sack that can hold objects with this total weight? You should complete this by hand to ensure that you can complete the solution on an exam. a: b: c: d: e: f: g