Given a graph $G=(V,E)$ and an integer $k|V|,$ design an efficient decrease and conquer algorithm to enumerate in lexicographical order all

subsets of $V$ of size $k$ that induce a connected graph.