$\}$ while $($minchange $<mtext></mtext><mn>0</mn><mi>)</mi>$;

Notice that when min$\_$i and min$\_$j are found, we apply the associated two opt move in the code however this part is not represented in the code $($instead it is mentioned as $//$apply mini$/$minj move in the code$).$ You may assume the associated two$-$opt move is also similarly adopted in the questions that are given below.

A$)$ Suppose we want to terminate the two$-$opt algorithm in $10000$ iterations. Update the code accordingly.

B$)$ Suppose we want to terminate the two$-$opt algorithm when the objective function cannot be improved more than $5\%.$ Update the code accordingly

C$)$ What is the difference of the above$-$given pseudo$-$code from $(A)$ and $(B)?$