Please give the detailed step by step solution for me to understand $($please draw the residual network after each flow augmentation, I don't understand when it's coded$).$Run the Ford$-$Fulkerson algorithm on the flow network in Figure $26\mathrm{.}8($b$)$ and show the residual network after each flow augmentation. Number the vertices in L top to bottom from $1$ to $5$ and in R top to bottom from $6$ to $9.$ For each iteration, pick the augmenting path that is lexicographically smallest.