The pseudocode below is an example of a heuristics for a graph vertex cover problem. It does not specify how to select a node on line 4 and 8:

1. Complete the pseudocode on line 4 and 8 with whatever strategy you can think of.

2. Use an example to show how the heuristcs will find a solution.

3. Give a counter example to show your strategy fails to find an optimal solution.

GVC V(VE) 2. while (ED 3. do 4. select v eV 5delee v from V and edges with v as an endpoint from E 6, C = Cu (v); 7 8 for eachue C 9. ifCfu is a valid cover GVC V(VE) 2. while (ED 3. do 4. select v eV 5delee v from V and edges with v as an endpoint from E 6, C = Cu (v); 7 8 for eachue C 9. ifCfu is a valid cover