Prove Vertex cover 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

$-$independent set

$-$clique