NP- problem. Please help with part B

Alice needs your help again! Alice is solving an assignment on Graph Theory, and, she observed that cycles in a graph is what makes the questions difficult. She is determined to make all the graphs acyclic with the minimum loss of vertices. She thinks solving this question is easy, but is it? Vertex Deletion: Given a directed graph G = (V, E), and an integer k is there a set V' SubsetEqual V with |V'| lessthanorequalto k such that V' contains at least one vertex from every directed cycle in G? Show that Vertex Deletion is in NP. Prove that Vertex Deletion is NP-Complete by showing Vertex Cover lessthanorequalto p Vertex Deletion