Acompany has three warehouses that supply four stores with a given product. Eachwarehouse has 30 units of the product. Stores 1, 2, 3, and 4 require 20, 25, 30, and 35units of the product,...

Acompany has three warehouses that supply four stores with a given product. Eachwarehouse has 30 units of the product. Stores 1, 2, 3, and 4 require 20, 25, 30, and 35units of the product, respectively. The per-unit shipping costs from each warehouseto each store are given in the following table:StoreWarehouse 1 2 3 4154652364434332a. Draw the network representation of this problem. What kind of problem is this?b. Formulate an LP model to determine the least expensive shipping plan to ?ll thedemands at the stores.c. Solve the problem using Solver.d. Suppose that shipments are not allowed between warehouse 1 and store 2 or be-tween warehouse 2 and store 3. What is the easiest way to modify the spread-sheet so that you can solve this modi?ed problem? What is the optimal solutionto the modi?ed problem?