Prove independent set is:

a$)$ NP using verifier

b$)$ NP hard, by writing the algorithmic steps using reduction from all of the following NP hard

problems

$-3$sat

$-$clique

$-$Vertex cover

Prove hitting set is:

NP hard, by writing the algorithmic steps using reduction from the following NP hard problem

Independent set