Consider a complete undirected graph G $=($V$,$ E$)$ in which all edge lengths

are either $1$ or $2.$ Propose a $4/3-$approximation algorithm for the Traveling

Salesman Problem on such graphs.

Hint: A $2-$matching is a subset S of edges such that every vertex has exactly

$2$ edges of S incident on it$.$ For a start, find a minimum $2-$matching in G$.$ You

may assume that a $2-$matching can be found in polynomial$-$time.

every solution on this website gives a solution with at least $3/4$ and understandable

please give me a $3/4-$approximation$($ i think it means at most $3/4$ opt$)$

with detailed algorithem and analysis and most important detailed proof of aproximation $)$

thank you