Question $2(40$ points$)$

Let's proof of NP$-$completeness to the Independent Set problem again, but this time, let's utilize the Clique problem for this purpose. You don't need to reiterate the NP proof for the Independent Set problem; instead, begin by establishing that Independent Set is NP$-$hard through the polynomial reduction of the Clique problem to Independent Set.

$3.(40$ points$)$ proof that Independent Set is NP$-$Hard $($Use Clique problem$)$