Consider the following final tablean obtained after simplex itreration for a maximization problem. (a) Lentify all the basic and noe-basic variahles. Ientify the carrot solution. (b) Generate as many Gotnoty's asts as powible. (c) Pick any of the above Gotnory's cat, and show it is wall. Cossider the followiag BaB exuseration tree: Answer the following hased on the abowe tree, nake the strategis discused in the class. Note: IFS stands for Inteser Feasible Solution. (d) Is it a maximization or a minimization problem? Explain. (e) Write all the poseible pairwise relations amoag A, B, C, D. Also suepent a poesble apper of lowr value for A, B, C, D. (f) What could be the node selection strategy is the ahove trev? Raplain your anawr usiag: best bound, depth first best bark, breadth first best beat, thomt teceut. (g) What could be the bratahing diretion selection strategy in the above tree? Explain your answe using: heach-up, branch-down, misod. (b) At (P3), the L.P solution is x1(9)=5,x2(9)=3.1,x1(x)=7,x2(9)=5.9. What could be the variable selection strategy? Explain your answer wing: Highest fracticin, losest fraction, or nearest to integer: (6) Fxplain a posible sequence of everits that occurred from sode (P3) to node (P5). Baced on the explanation, what should be the sext node to procese? (k) What is the iscumbent solution in the above tree? How far is it froen the slobal optimal solution? Consider the following final tablean obtained after simplex itreration for a maximization problem. (a) Lentify all the basic and noe-basic variahles. Ientify the carrot solution. (b) Generate as many Gotnoty's asts as powible. (c) Pick any of the above Gotnory's cat, and show it is wall. Cossider the followiag BaB exuseration tree: Answer the following hased on the abowe tree, nake the strategis discused in the class. Note: IFS stands for Inteser Feasible Solution. (d) Is it a maximization or a minimization problem? Explain. (e) Write all the poseible pairwise relations amoag A, B, C, D. Also suepent a poesble apper of lowr value for A, B, C, D. (f) What could be the node selection strategy is the ahove trev? Raplain your anawr usiag: best bound, depth first best bark, breadth first best beat, thomt teceut. (g) What could be the bratahing diretion selection strategy in the above tree? Explain your answe using: heach-up, branch-down, misod. (b) At (P3), the L.P solution is x1(9)=5,x2(9)=3.1,x1(x)=7,x2(9)=5.9. What could be the variable selection strategy? Explain your answer wing: Highest fracticin, losest fraction, or nearest to integer: (6) Fxplain a posible sequence of everits that occurred from sode (P3) to node (P5). Baced on the explanation, what should be the sext node to procese? (k) What is the iscumbent solution in the above tree? How far is it froen the slobal optimal solution