Give an example of a graph for which the approximate vertex-cover algorithm always yields a suboptimal solution, and justify your answer.

Algorithm:

C

E' E[G]

while E' is not empty{

let (u, v) be an arbitrary edge of E'

C C {u, v}

remove from E' every edge incident to either u or v}

return C