For the linear programming model of the minimum cost flow problem over the following network, where the number in round parentheses at each arc indicates its arc cost, the number in square parentheses at each node indicates its required supply, the number preceded by a colon at an arc indicates its are capacity, and arcs without such numbers are unbounded arcs, |-50) |-40) [20] (70) B E 40 101 (-30) : 10 40 [40] what are the basic variables in the basis that determines the spanning tree with arcs {AC, BC, CF, EC, FD, FG} and reverse arcs DC, GD? (The tree is highlighted in the network.) (Flow variables are labelled Xuy and slack variables are labelled tuw) XAC XBC 00000 XBE XCF XDA XDC XEC XFD XFE 0 XFG TAC CF 00000 toC FD IGD For the linear programming model of the minimum cost flow problem over the following network, where the number in round parentheses at each arc indicates its arc cost, the number in square parentheses at each node indicates its required supply, the number preceded by a colon at an arc indicates its are capacity, and arcs without such numbers are unbounded arcs, |-50) |-40) [20] (70) B E 40 101 (-30) : 10 40 [40] what are the basic variables in the basis that determines the spanning tree with arcs {AC, BC, CF, EC, FD, FG} and reverse arcs DC, GD? (The tree is highlighted in the network.) (Flow variables are labelled Xuy and slack variables are labelled tuw) XAC XBC 00000 XBE XCF XDA XDC XEC XFD XFE 0 XFG TAC CF 00000 toC FD IGD