$($a$)$ Design a O$(|$E$|)$ algorithm that can detect whether the maximum flow is infinite.

$($b$)$ Modify the Capacity Scaling Algorithm so that it can find in polynomial time the maximum

flow in a flow network where some of the edges have infinite capacity