Consider the following problem: Input graph G, integers k d Question: does G contain a sub/graph with k vertices such that every vertex of that sub/graph has a degree d? then the answer is YES (red vertices form a subgraph of G on 4 vertices with all degrees equal to 2. Note: degrees in subgraph, we disregard blue vertices and edges from them) Show that this problem is NP-complete