Consider the problem Q defined below. Prove whether or not problem Q is in NP An undirected graph G(V, E) and a positive integer k. QUESTION: Does graph G have a subset C of nodes such that |C| = k...

Consider the problem Q defined below. Prove whether or not problem Q is in NP

An undirected graph G(V, E) and a positive integer k.

QUESTION: Does graph G have a subset C of nodes such that |C| = k and there exists an edge in E between every pair of nodes in C?