The case graph below by using a predetermined solution approach Given adjacency matrix as follows: A B C D E A B CDE 0 2 0 6 1 1 0 4 4 2 5 3 0 1 5 4 7 2 0 1 2 6 3 6 0 Using the Branch and Bound approach, provide a solution for the Traveling Salesman Problem if the salesman starts his journey from vertex A. Make sure you include an explanation of branching for subproblems and bound conditions in your analysis?

A spanning tree is a sub-graph of a connected, undirected graph. It has all the vertices of a graph with the minimum possible number of edges. If a vertex is skipped, then it will not be a spanning tree. The edges of a spanning tree may or may not have w…