Q. A manufacturer of printed circuit boards uses programmable drill machine to drill five holes in each board. The x also y coordinates of each hole are given in the right table. The time (in seconds) it takes the drill machine to move from one hole to the next is equal to the Euclidean distance between the two holes. The organization needs to find out a drilling order of the five holes minimizing the total time which the drill machine spends moving between holes. Formulate this problem as a TSP problem also then solve it using the branch also bound approach for TSP to Find out an optimal drilling order.

Hole x y
1 1 2
2 3 1
3 5 3
4 7 2