The Min Cost Flow Problem $($multiple$)$: Example $2$

Consider the problem of sending flow through the following

network with

two sources A and B$,$ producing $2$ and $3$ units of flow

respectively

and two sinks F and E $,$ consuming $4$ and $1$ units of flow

respectively

The first number on the arcs represents the capacity of the

arc and the second number represents the cost of a unit of

flow on the arc

Please Solve and if possible include AMPL code