$2($a$.)$ Construct a graph $G$ for which the APPROX$-$VERTEX$-$COVER algorithm provides a sub$-$

optimal solution.

$($b$.)$ Design an efficient linear time algorithm for computing an optimal VERTEX$-$COVER for trees.