$5.$ Find the shortest path through the TSP algorithm in a graph with the following adjacency matrix W$.$

$1)$ When trying to obtain it using the best$-$first method, draw the generated state space tree.

For each node, write a path in the format $[1,2]$ and write the bound or length value below it$.$

$2)$ In the tree above, write the order of removal$()$ from the queue. ex $)[1,2]->[1,2,3]$

$**$ Please explain in detail how to find the bound...