Consider the following final tablean obtained after simplex iteration for a maximination problem. Assume the problem satisfies the conditions needed to develop Gomory's fractional cut. Assume that the objective function coefficients in the original problem were integer. (a) Ideatify all the basic and noo-basic variables. Ideatify the curreat solution. (b) Gencrate as many Gomory's cuts as porsible. (c) Pick any of the above Gomory's cut, and show it is makes the current solution infersible. Consider the following BnB emumeration tree: Answer the following based on the above tree, using the strategies discussed in the class. Note: IFS stands for Integer Feasible Solution. (d) Is it a maximization or a minimiration problem? Explain. (e) Write all the possible pairwise relations among A,B,C,D. Also suggest a possible upper or lower value for A,B,C,D. (f) What coald be the node selection strategy in the above tree? Explain your answer using: best bound, depth first best badk, breadth first best next, most recent. (g) What could be the beanching direction selection strategy in the above tree? Explain your answer using: beanch-up, branch-down, mixed. (h) At (P3), the LP solution is x1(3)=5,x2(3)=3.1,x1(3)=7,x4(3)=5.9. What could be the vuriable selection strategy? Explain your answer using: highest fraction, lowest fruction, or nearest to integer. (i) Write the relationship between E \& F. Also suggest a possible upper or lower value foe E \& F. (j) Explain a possible seqponce of eveats that occurred from node (P7) to node (P9). Based on the explanation, what should be the next node to process? (k) What is the incumbeat solution in the ahove tree? How far is it from the global optimal solutioa