(2) Bottleneck Capacities: the Marimum Capacity Augmenting Path Algorithm. Suppose, in the tth iteration, the maximum capacity augmenting path algo rithm uses a path with bottleneck capacity u in the residual graph Gr. Is it always the case that the we are weakly decreasing, that is, 422 42...? Either prove this is true or present a counterexample. (2) Bottleneck Capacities: the Marimum Capacity Augmenting Path Algorithm. Suppose, in the tth iteration, the maximum capacity augmenting path algo rithm uses a path with bottleneck capacity u in the residual graph Gr. Is it always the case that the we are weakly decreasing, that is, 422 42...? Either prove this is true or present a counterexample