Suppose that FL plans to put the same number of cartons for each fruit on each truck, in other words, suppose that FL sets A = A = A = 1300 and M = M M = 1200. Is this a feasible plan? (b) Irrespective of whether or not the plan in part a) is feasible, what is the total revenue that FL would earn under this plan? (c) Write down an algebraic expression for the revenue as a function of decision variables A, A, A3, M, M, M3. (d) Using these decision variables, write down an algebraic expression for the constraint "the total number of fruit cartons shipped in truck 1 cannot exceed this truck's capacity". (e) Use the file Keystone.xlsx as a template to set up and solve the FL's optimization problem using Excel and Solver. What is the optimal solution? What is the optimal objective function value? Truck no. Avocado 5 4 3 1 % Losses in Transit 2 3 Mango 10 12 11 For example, 5% of avocados in each carton placed in truck 1 and 11% of the mangoes placed in truck 3 will be spoiled upon arrival in Philadelphia. FL sells the unspoiled avocadoes for $20 per carton and unspoiled mangoes for $32 per carton. Because of spoilage during transport to Philadelphia, however, FL must discount the amounts for which it sells cartons of fruit. For example, because 5% of the avocados shipped in truck 1 will be spoiled by the time they reach Philadelphia, FL will be able to cartons shipped on truck 1 for only $20*(1-0.05) = $19. Similarly, because 11% of the mangoes shipped on truck 3 will have spoiled, FL can sell cartons of mangoes shipped on truck 3 for only $32*(1-0.11) = $28.48. FL needs to determine the number of cartons of each fruit to load on each truck to maximize its revenue from selling fruits in Philadelphia. FL wishes to determine the number of cartons of each fruit to load on each truck to maximize its revenue from selling fruits in Philadelphia. Let A, A, and A, be the number of cartons of avocado loaded on trucks 1, 2, and 3, respectively, and let M, M, and M. be the numbers of cartons of mango loaded on trucks 1, 2, and 3, respectively.