find a shortest st-path in the following graph by applying the Shortest Path Algorithm. For each iteration, you should include the current set of vertices U, the slack of the edges in 8(U), the assigned cut width yu, and the arc added. Conclude your solution with a set of feasible st-cut widths whose total is equal to the length of your shortest st-path. S 1 2 1 1 2 b 5 10 6 2 1 t