Given a flow network as below with S and T as source and sink (destination). The pair of integers on each edge corresponds to the flow value and the capacity of that edge. For instance, the edge (S,A)...

Given a flow network as below with S and T as source and sink (destination). The pair of integers on each edge corresponds to the flow value and the capacity of that edge. For instance, the edge (S,A) has capacity 20 and currently is assigned a flow of 7 (units). Assume that we are using the Ford-Fullkerson's method to find a maximum flow for this problem.a) what isthe capacity of the
backward edge
T->B in the
residual network?


b) what
is an
augmenting path
in the corresponding
residual network
?c) what is the
value of a maximum flow
?