Given a department needs a committee to select the department’s head. The committee cannot include people who have conflicts of interest with each other. The input consists of:

* the desired committee size
* a list of all people
* a list of all pairs of people that are conflicted.

The goal is to determine whether there’s a conflict-free committee of that size.

How can I show that this problem is NP-complete and is in NP?