Use the Ford$-$Fulkerson algorithm to find the maximum flow from s to t in the graph of Figure $8\mathrm{.}19,$ assuming the first five moves are

s $->$ r$1->$s$1->$ t

s $->$ r$1->$s$2->$ t

s $->$ r$1->$s$3->$ t

s $->$ r$2->$s$1->$ t

s $->$ r$2->$s$2->$ t

Show the iterations.