A$)$ How can you terminate the algorithm that is given above. List at least $2$ different termination

conditions.

B$)$ Suppose the first two$-$opt move that improves the objective function value can be directly

adopted at each iteration of the algorithm. That is we do not need to find the best two$-$opt as it

is given in the pseudo code. How should we update the algorithm to do that?

C$)$ We want to adopt two$-$opt moves that improves objective function value at least $5\%$ at each twoopt iteration of the algorithm. How should we update the algorithm to do that?

Do we have negative cycle in this graph? Explain!