points) Which of the following is a true statement? Choose any/all the apply. If the Vertex Cover Problem can be solved in poly-time, then the Independent Set Problem can be solved in poly-time. If the Independent Set Problem can be solved in time poly-time, then the Vertex Cover Problem can be solved in poly-time. Given a graph G=(V,E), there is a vertex cover in G of size k if and only if there is an independent set in G of size nk, where n=V