$10\mathrm{.}5-1.$ For the network shown below, use the augmenting path

algorithm described in Sec. $10\mathrm{.}5$ to find the flow pattern giving the

maximum flow from the source to the sink, given that the are capac$-$

ity from node $i$ to node $j$ is the number nearest node i along the are

between these nodes. Show your work.