Express the following pieces of information as linear inequalities: (a) One store location needs to fill at least 10 slots on their shelves with your products. (b) Another store needs 2 of your first product and 8 of your second product in each slot, but only has at most 300 open slots on their shelves. (c) When manufacturing your product you have one machine which can make 2 of your first product and 4 of your second product every minute and has a total of 4 working hours each day. (d) You can only ship at most 50 of your second product each day. (e) You can only ship at most 100 of your first product each day. If your objective if to maximum your revenue in a day, write out explicitly what your linear program will be based on your answers to parts 1 and 2. Make sure to explicitly state what is the objective function and what are the constraints.