3. Vertex Cover on Planar Graphs. The problem Planar Vertex Cover is to find a smallest set C of vertices in a given planar graph G such that every edge in G has at least one endpoint in C. It is known that Planar Vertex Cover is NP-hard. Develop a polynomial time approximation scheme (PTAS) for the problem.