Thank you!!

At each iteration (step), the maximal flow solution algorithm works by allowing the user to choose any path through the network (from source to destination) that has positive remaining flow capacity True False The local Internet provider wants to develop a tree-like 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: the cities are the branches, and the server is the node. the cables are the branches and the cities are the nodes. the cities are branches and cables are nodes. the server is the branch and the cities are the nodes. The origin node is the input node in a maximal flow problem. True False The destination node is the input node in a maximal flow problem. True False