Using the code in SAT and the check() method from Exercise 5.5.7 as a starting point, develop a program VertexCover that finds a solution to the vertex cover problem for any given graph (and upper...

Using the code in SAT and the check() method from Exercise 5.5.7 as a starting point, develop a program VertexCover that finds a solution to the vertex cover problem for any given graph (and upper bound m on the number of vertices in the cover).

Exercise 5.5.7

Write a method that takes a graph G and a subset of vertices, and determines whether the subset of vertices is a vertex cover.