6.14. Use the Ford-Fulkerson algorithm to find the minimum cut in the undirected network shown in Figure 6.23. Show the residual network at the end of each augmentation and specify the minimum cut that the algorithm obtains when it terminates.6.14. Use the labeling algorithm to establish a maximum flow in the undirected network shown in Figure 6.23.Show the residual network at the end of each augmentation and specify the minimum cut that the algorithm obtains when it terminates.Source1T5Figure 6