Consider the reduction from 3-SAT to Independent Set. Given (x ∨ y ∨ z) ∧ (x ∨ ¬ y ∨ ¬ z) ∧ ( ¬ z ∨ z) as an instance of 3-SAT, construct the instance of Independent Set. You do not have to give a true/false assignment. Just show the reduction diagram and explain it, illustrate the construction for this instance, and argue why the reduction works.