We are given an undirected, unweighted graph and a non-negative integer K.
- We have to choose exactly K vertices of the input graph, such that there is an edge between each of the vertices chosen