Please show work and steps and rewrite the questions so I dont get confused also, we type answers do not hand write it

II) What is the constraint for El Paso for the Mantastic problem? iv) Find optimal shipments which result in minimum total cost. You do not need to use any software (or algorithm) to solve this problem, just look at the transportation costs and find the best flow to limit the total cost as much as possible. Please show your final answer (ie optimal shipments) on the network, where arcs are presented only if they have a nonzero shipment Page 2 1- Mantastic Devices designs and manufactures high-end support garments for men. The facilities in Manhattan and Atlanta serve as design and component manufacturing facilities. Components are then shipped to warehouses in Philadelphia or Knoxville, where they are held until final assembly is completed at either Memphis, New Orleans, or El Paso. Manufacturing capacity in Manhattan and Atlanta is 800 units. Demand at Memphis, New Orleans, and El Paso is 450, 500, and 610, respectively. The network representing the shipping routes is shown below. Memphis New Orleans 6 Pas The costs for shipping between each facility is shown below. A blank cell indicates that shipping between two facilities is not permitted. Memphis New Orleans El Paso Philadelphia $4 $22 Knoxville $25 $3 Manhattan |Atlanta Philadelphia Knoxville $3 $20 $30 $40 $3 $6 $15 $20 1) What is the objective function for the Mantastic problem? Use the notation Xy, where and correspond to the node numbers indicated in the diagram ii) What is the constraint for the transshipment node in Philadelphia for the Mantastic problem? Page 1