3. Consider the maximal flow problem of the following graph with entrance 1 and exit 6: 3 (1). Use the max flow-min cut theorem to compute the value of maximal flow (2). Exhibit a flow which achieves the value computed in 1)