Consider a variant of the network flow problem in which nodes $($other than the source$)$ also have $($positive$)$ capacities. A flow across the network must respect the additional constraints that the flows coming into nodes do not exceed their $($node$)$ capacities. This problem can be solved by efficiently reducing it to the original network flow problem.

Group of answer choices

True

False