You are given a directed network with 6 nodes and 9 edges, with a cost on each edge, as specified in the table below. You have to send two units of flow from node a to nodef along the edges in the network. Each edge can carry any non-negative amount of flow (i.e. the capacity of each edge is infinite). No node other than "a" and "T" can consume or produce any flow. If an edge of cost o carries r units of flow, then the energy usage of that edge is c?. The total energy used is the sum of the energies used by each edge. Use exoel to compute the minimum possible total energy used, and the corresponding flow on each edge. From To b Cost & 8 C d & 2 1 b f 2 d d e The Edges of the network A. DO Edges From To e b UD b d e d 2 NO Cost 1 1 1 1 1 1 1 Matrix A 1 1 O 1 -1 0 0 1 0 0 -1 -1 0 OOOO OOOO OOOO OOOO OOOO 0 0 -1 0 -1 Oo OO 0 0 1 -1 -1 You are given a directed network with 6 nodes and 9 edges, with a cost on each edge, as specified in the table below. You have to send two units of flow from node a to nodef along the edges in the network. Each edge can carry any non-negative amount of flow (i.e. the capacity of each edge is infinite). No node other than "a" and "T" can consume or produce any flow. If an edge of cost o carries r units of flow, then the energy usage of that edge is c?. The total energy used is the sum of the energies used by each edge. Use exoel to compute the minimum possible total energy used, and the corresponding flow on each edge. From To b Cost & 8 C d & 2 1 b f 2 d d e The Edges of the network A. DO Edges From To e b UD b d e d 2 NO Cost 1 1 1 1 1 1 1 Matrix A 1 1 O 1 -1 0 0 1 0 0 -1 -1 0 OOOO OOOO OOOO OOOO OOOO 0 0 -1 0 -1 Oo OO 0 0 1 -1 -1