Problem 1 Let S-fa, b, c, d, e, f, g) be a collection of objects with benefit-weight values as follows: a:(24.8), b:(20.12), c:(16,10), d(22. 14), e:(28.6), f:(14,2), g:(18.12). What ?s an optimal solution to the fractional knapsack problem for S assuming we have a sack that can hold objects with total weight 36? Show your work