The Christofides heuristic approximates (Metric) TSP within a factor of 3/2 (see lectures). Clive an example that shows that this bound cannot be improved, i. e., construct instances of (Metric) TSP (for general vertex numbers) such that Christofides yields a solution that asymptotically achieves this approximation ratio