Consider the execution of the Augmenting Path Algorithm for the max-flow problem from node S to node T in a network. Suppose that the current flow is augmented along the path SAC>E > T. Which of the following are true? The residual network in the next iteration will have no S to T path The residual network in the next iteration will have a unique S to T path The residual network in the next iteration changes only along the path S - A - C - E - T The residual network in the next iteration could change arbitrarily Question 8 1 pts Which of the following are true? An unbalanced assignment problem can be converted to a balanced transportation problem An unbalanced transportation problem can be converted into a balanced assignment problem Dijkstra's algorithm will terminate in at most n iterations, where n is the number of vertices in the graph. Max-flow problem can be solved using the Simplex Method Question 9 1 pts Which of the following are true for a zero-sum game? The gain of one of the players is equal to the loss of the other player It is impossible for both players to earn positive profits for a given strategy pair The payoff matrices for player A and player B are identical The payoff matrix is a square matrix (i.e., number of rows = number of columns) and it is symmetric about the main diagonal