How to reduce k-independent set problem to 3-SAT

Question

So I got this homework question and we are asked to reduce a k-independent set satisfiability problem to a 3-SAT set of clauses under the conjunctive normal form.

So