We are given an undirected graph and non negative integer K. We have to find out if there exists a subset of vertices of size atmost K such that for each vertex either it is in this subset or has a neighbour in this subset. 