1. The local Internet provider wants to develop a network that will connect its server at its satellite center in Valparaiso with the main city computer centers in Northwest Indiana to improve the Internet service and to minimize the amount of cable used to connect network nodes. If we represent this problem with a network,
a) the cities are branches and cables are nodes.
b) the cables are the branches and the cities are the nodes.
c) the length of cables in miles are the branches, and the cities are the nodes.
d) the cities are the branches and the length of cables in miles are the nodes.
2. The maximal flow algorithm
a) does not require flow on every branch for the final solution.
b) may end with capacity remaining at the source.
c) may end with capacity at those nodes leading immediately to the destination.
d) All of these