This problem is similar to Boolean Satisfiability Problem (SAT) problem which is First NP-Complete problem.
A problem is NP-Complete it means it is in NP as well as NP-Hard, i.e. intersection of both NP and NP-Hard is NP-Complete.
Hence, option (E) is right.