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, (-60) 1-40 (3) 30 160 -601 16) 80] 110 determine the reduced costs of all variables for the basis that determines the spanning tree with arcs (AC, AF, BE, DH, EG, GF, GH) and reverse arc CG. (The tree is highlighted in the network.) (Flow variables are labelled Xuy and stack variables are labelled tyn) Variable Reduced cost > XAB > XAF XBD V XCF Xca XEC PEG XGE ICF TCG TOH TEG EGF 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, (-60) 1-40 (3) 30 160 -601 16) 80] 110 determine the reduced costs of all variables for the basis that determines the spanning tree with arcs (AC, AF, BE, DH, EG, GF, GH) and reverse arc CG. (The tree is highlighted in the network.) (Flow variables are labelled Xuy and stack variables are labelled tyn) Variable Reduced cost > XAB > XAF XBD V XCF Xca XEC PEG XGE ICF TCG TOH TEG EGF