Using the graph below solve the Traveling Salesperson Problem using the branch and bound technique. Develop and turning the state space tree that would solve the problem.

The Traveling Salesman Problem

$-$ Starting from city $1,$ the salesmar must travel to all cities once before returning home

$-$ The distance between each city i given, and is assumed to be the same in both directions

$-$ Only the links shown are to be used

$-$ Objective $-$ Minimize the total distance to be travelled