Extra credit, Graph G with 25 vertices has 10 pair-wise nonadjacent vertices. a) at least 10 vertices because Minimum vertex cover of G always has Yes No Don't know b) at most 15 vertices Yes No Don't know because