Question: The minimum vertex cover problem, MIN-VCP, is a minimization problem, where one searches for a vertex cover of minimal cardinality for a given graph G.
(i) Estimate the set of all vertex covers of the graph in Figure.
(ii) Give a formal specification of MIN-VCP as a 6-tuple. Use the alphabet {0, 1, #} to represent the input instances and the feasible solutions.
