$($a$).$ Demonstrate the approximation algorithm to find the minimum cost tour

$($TSP$)$ on graph.

$($b$).$ Compare the cost of the algorithm to the optimal cost.