Suppose we are solving an integer program, and we performed simplex on its LP relaxation to obtain the following tableau. $([1,0,5\mathrm{.}3,0,1\mathrm{.}8,6\mathrm{.}9],[0,1,7\mathrm{.}5,0,-1\mathrm{.}5,4\mathrm{.}5],[0,0,2\mathrm{.}7,1,-6\mathrm{.}2,9])$ Perform one step in the cutting plane heuristic, which includes the following: Derive a cutting plane from this tableau. Add the cutting plane to the tableau $($after doing something to it$).$ Rewrite the tableau in canonical form. On your tableau, circle the entry that you need to pivot on$,$ and state if you should perform primal simplex or dual simplex. Do NOT perform the pivot itself, we just want to know which entry to pivot on$.$ Consider the following instance of the travelling salesman problem $($TSP$),$ where the cost of travelling between two points is the length of the straight line distance between them. The goal is to find a shortest "tour", which is a way to visit every point exactly once and come back to where we start from. $($a$)$ In class, we have the formulation of TSP based on the fact that there are $2$ edges used by each city. By solving the LP relaxation, we get the following optimal solution, where the dashed edges have value $0\mathrm{.}5,$ while all other edges have value $1.$ We see that this is not a valid tour, so we introduced possible cutting planes. Circle a set of vertices that can generate a subtour cut that is a valid cutting plane for the solution below.

can you please help with these questions? I have an exam on august $7$th