Let s = {a, b, c, d, e, f, g} be a collection of objects with benefit-weight values, a: (12,4), b: (10,6), c: (8,5), d: (11,7), e: (14,3), f: (7,1), g: (9,6). what is an optimal solution to the fractional knapsack problem for s assuming we have a sack that can hold objects with total weight 18? show your work.

The ancient greeks had quite a variety of coins. some of these coins included the talent, mina, drachma and obolus, which could be exchanged according to the following: • 1 talent = 60 minae (plural of mina) • 1 mina = 70 drachmae (plural of drachma) • 1 drachma = 6 oboloi (plural of obolus) write a program that asks the user to enter a number of oboloi, and then determines the fewest number of each coin needed to represent that amount, starting with the highest (hint: use the % operator). here is a sample run of the program, showing how input and output must be formatted: enter number of oboloi: 64197 [enter] that number of oboloi is equal to: 2 talents 32 minae 59 drachmae 3 oboloi