Capacity Scaling strategy can be used in Augmenting Path $($for Max$-$Flow$)$ and Successive Shortest Path $($for Min$-$Cost Flow$)$ to overcome the drawback of $....$

a$.$

more flow pushing at each iteration.

b$.$

fast convergence of the algorithm.

c$.$

excessive iterations due to path selection.

d$.$

high memory usage.