In the Half-Vertex Cover problem, you are given an undirected graph G = (V,E) and an integer k. You want to determine whether there is a set of nodes S V such that |S| k, and at least half of the edges in E have at least one endpoint in S. Prove that Half-Vertex Cover is NP-Complete.