Find the approximate solution using Minimum Spanning tree algorithm in finding

the shortest path route for the salesman who wishes to visit all cities mentioned as

nodes in the following graph. Ie The path which includes all the cities ie nodes in the

graph without repeating. Also find the optimal shortest distance path and distance using

any one of the algorithm. Compare the approximate solution with the optimal solution

and prove the cost of approximate solution is less than or equal to $2$ time the cost of

optimal solution

$c(H)2c(H^{**})3)$ Find the approximate solution using Minimum Spanning tree algorithm in finding the shortest path route for the salesman who wishes to visit all cities mentioned as nodes in the following graph. Ie The path which includes all the cities ie nodes in the graph without repeating. Also find the optimal shortest distance path and distance using any one of the algorithm. Compare the approximate solution with the optimal solution and prove the cost of approximate solution is less than or equal to $2$ time the cost of optimal solution

c$($Hc$($H$*)$