Let DOUBLE-SAT = { ( ∅ ) I ∅ has at least two satisfying assignments). Show that DOUBLE-SAT is NP-complete.