2. Consider a network of flows consisting of 25 nodes (call them A, B, these nodes, as shown in the table below. Each arc is identified by its starting node and its terminal mode: for example, the are AP connects node [A] to node [Pl and it represents a one-directional flow starting at node |Al and ending at node [P] Lower (other than zero) and upper bounds for the flows are also shown in the table -Y) and the 100 arcs casecting Lower 70 60 60 10 50 40 S0 0 a Formelate a linear programming model to find the maximum flow that can be sent from IA] to VJ. Solve this problem using Excel or Lingoc use the following table to show optimal solution: Maximum Flow from Al to [a QT b. in (a) Draw a network diagram illustrating the optimal solution (flows thru the network) that you found C. The table below show the costs (S/unit) of sending one unit of flow thru each arc in the network use linear programming find the minimum-cost routes that should be used for sending 300 units of flow from to M DB DG DI DO DO Du b. Draw a network diagram illustrating the optimal solution (ows thru the network) that you found in (a). c. The table below show, the costs (S/unit) of sending one unit of flo thru each arc in the network: use linear programming, find the minimum-cost routes that should be used for sending 300 units of flow from [A] to [Y Use the following table to show your answer Arc Flo Arc lw A FowArcFlow Arc Flow d. Draw a metwork diagram illustrating the optimal solution (flows thru the network) that you found in Find the minimum-cost for sending 200, 250,275,. MaxFlow [the value that you found in (a)) units of flow from [A to [Y. Make a table and a graph showing the flow and their corresponding minimun e. 2. Consider a network of flows consisting of 25 nodes (call them A, B, these nodes, as shown in the table below. Each arc is identified by its starting node and its terminal mode: for example, the are AP connects node [A] to node [Pl and it represents a one-directional flow starting at node |Al and ending at node [P] Lower (other than zero) and upper bounds for the flows are also shown in the table -Y) and the 100 arcs casecting Lower 70 60 60 10 50 40 S0 0 a Formelate a linear programming model to find the maximum flow that can be sent from IA] to VJ. Solve this problem using Excel or Lingoc use the following table to show optimal solution: Maximum Flow from Al to [a QT b. in (a) Draw a network diagram illustrating the optimal solution (flows thru the network) that you found C. The table below show the costs (S/unit) of sending one unit of flow thru each arc in the network use linear programming find the minimum-cost routes that should be used for sending 300 units of flow from to M DB DG DI DO DO Du b. Draw a network diagram illustrating the optimal solution (ows thru the network) that you found in (a). c. The table below show, the costs (S/unit) of sending one unit of flo thru each arc in the network: use linear programming, find the minimum-cost routes that should be used for sending 300 units of flow from [A] to [Y Use the following table to show your answer Arc Flo Arc lw A FowArcFlow Arc Flow d. Draw a metwork diagram illustrating the optimal solution (flows thru the network) that you found in Find the minimum-cost for sending 200, 250,275,. MaxFlow [the value that you found in (a)) units of flow from [A to [Y. Make a table and a graph showing the flow and their corresponding minimun e