e directed weighted graph where edge weights indicate capacity values. Our goal is to rom source 's' to sink 't. Assume that our algorithm chooses augmenting paths (on 9. 110 pts total Max-Flow Problem the residual graph) in the following order First augmenting path:s-C-D-B-r . Second augmenting path: s-C-D- Third augmenting path: s-A-B-D-t Fourth augmenting path: s-A-B- ch augmentation process, you are required to send maximum possible flow along the augmenting inoud result in at least one edge on the path to become saturated. Note that the original graph can be (a) 12 pts) Draw residual graph after you have updated the flow using the first augmenting path. Indicated used as the initial residual graph. how much flow you have sent along this path. (b) 12 pts] Draw residual graph after you have updated the flow using the second augmenting path. Indicated how much flow you have sent along this path