(2) Bottleneck Capacities: the Maximum Capacity Augmenting Path Algorithm. Suppose, in the tth iteration, the maximum capacity augmenting path algo- rithm uses a path with bottleneck capacity ut in the residual graph Gfi Is it always the case that the ut are weakly decreasing, that is, ui > U2 > uz >...? Either prove this is true or present a counterexample. (2) Bottleneck Capacities: the Maximum Capacity Augmenting Path Algorithm. Suppose, in the tth iteration, the maximum capacity augmenting path algo- rithm uses a path with bottleneck capacity ut in the residual graph Gfi Is it always the case that the ut are weakly decreasing, that is, ui > U2 > uz >...? Either prove this is true or present a counterexample