Question <p>&nbsp;Which of the following is known to be not an NP-Hard Problem?</p>

Option 1 <p>Vertex Cover Problem</p>

Option 2 <p>0/1 Knapsack Problem</p>

Option 3 <p>Maximal Independent Set Problem</p>

Option 4 <p>Traveling Salesman Problem</p>

Correct Answer Option 1 Option 2 Option 3 Option 4