Seven types of packages are to be delivered by five trucks. There are three packages of each type, and the capacities of the five trucks are 8, 3, 2, 5, and 3 packages, respectively. Set up a maximum-flow problem that can be used to determine whether the packages can be loaded so that no truck carries two packages of the same type.

(HINT: You may want to create an artificial source that sends at most 3 packages to each type of package and an artificial sink that receives all the packages put on the trucks.)

Seven types of packages are to be delivered by five trucks. There are three packages of each type, and the capacities of the five trucks are 8, 3, 2, 5, and 3 packages, respectively. Set up a maximum-flow problem that can be used to determine whether the packages can be loaded so that no truck carries two packages of the same type. (HINT: You may want to create an artificial source that "sends" at most 3 packages to each type of package and an artificial sink that "receives" all the packages put on the trucks.)