3. (10 points) Give a linear program for the following problem. You are in charge of Di- visible Objects Incorporated: the company that only sells loose objects that can be easily divided (flour, sand, water, etc.). You need to pack your shipping containers with things to sell however, your containers have a given volume and can only lift a certain amount of weight. The goal is to pack the containers so as to maximize the revenue. Formally, you are given a list of rational number triples {(W1, V1, C), (W2, V2, C2), ..., (Wn, Un, Cn)}, as well as two positive integers V, W. The triple (Wi, Vi, Ci) represents an item of which you have w; kilograms to sell, with density vi liters per kilogram, and selling price ci per kilogram. The integer V represents the volume of your shipping crate, and the integer W represents the maximum weight that your shipping crate can lift in kilograms. Your linear program should optimize the maximum revenue obtained by packing your shipping crate with items chosen from the list. 3. (10 points) Give a linear program for the following problem. You are in charge of Di- visible Objects Incorporated: the company that only sells loose objects that can be easily divided (flour, sand, water, etc.). You need to pack your shipping containers with things to sell however, your containers have a given volume and can only lift a certain amount of weight. The goal is to pack the containers so as to maximize the revenue. Formally, you are given a list of rational number triples {(W1, V1, C), (W2, V2, C2), ..., (Wn, Un, Cn)}, as well as two positive integers V, W. The triple (Wi, Vi, Ci) represents an item of which you have w; kilograms to sell, with density vi liters per kilogram, and selling price ci per kilogram. The integer V represents the volume of your shipping crate, and the integer W represents the maximum weight that your shipping crate can lift in kilograms. Your linear program should optimize the maximum revenue obtained by packing your shipping crate with items chosen from the list