Q$1.$ Consider the traveling salesman problem shown below, where city $1$ is the home city.

Starting with $1-2-5-4-3-6-1$ as the initial trial solution, apply the basic tabu search algorithm by hand to this problem for three iterations.