We are given an undirected, unweighted graph and a non-negative integer K.
- We have to choose at most K vertices of the input graph, such that for each edge in the input graph, at least one of the vertices of the edge is selected